29.79/20.56 YES 29.79/20.56 29.79/20.56 Ultimate: Cannot open display: 29.79/20.56 This is Ultimate 0.1.24-8dc7c08-m 29.79/20.56 [2019-03-28 12:00:16,071 INFO L170 SettingsManager]: Resetting all preferences to default values... 29.79/20.56 [2019-03-28 12:00:16,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 29.79/20.56 [2019-03-28 12:00:16,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 29.79/20.56 [2019-03-28 12:00:16,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 29.79/20.56 [2019-03-28 12:00:16,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 29.79/20.56 [2019-03-28 12:00:16,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 29.79/20.56 [2019-03-28 12:00:16,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 29.79/20.56 [2019-03-28 12:00:16,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 29.79/20.56 [2019-03-28 12:00:16,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 29.79/20.56 [2019-03-28 12:00:16,093 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 29.79/20.56 [2019-03-28 12:00:16,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 29.79/20.56 [2019-03-28 12:00:16,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 29.79/20.56 [2019-03-28 12:00:16,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 29.79/20.56 [2019-03-28 12:00:16,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 29.79/20.56 [2019-03-28 12:00:16,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 29.79/20.56 [2019-03-28 12:00:16,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 29.79/20.56 [2019-03-28 12:00:16,101 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 29.79/20.56 [2019-03-28 12:00:16,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 29.79/20.56 [2019-03-28 12:00:16,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 29.79/20.56 [2019-03-28 12:00:16,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 29.79/20.56 [2019-03-28 12:00:16,107 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 29.79/20.56 [2019-03-28 12:00:16,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 29.79/20.56 [2019-03-28 12:00:16,108 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 29.79/20.56 [2019-03-28 12:00:16,109 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 29.79/20.56 [2019-03-28 12:00:16,109 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 29.79/20.56 [2019-03-28 12:00:16,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 29.79/20.56 [2019-03-28 12:00:16,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 29.79/20.56 [2019-03-28 12:00:16,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 29.79/20.56 [2019-03-28 12:00:16,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 29.79/20.56 [2019-03-28 12:00:16,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 29.79/20.56 [2019-03-28 12:00:16,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 29.79/20.56 [2019-03-28 12:00:16,114 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 29.79/20.56 [2019-03-28 12:00:16,129 INFO L110 SettingsManager]: Loading preferences was successful 29.79/20.56 [2019-03-28 12:00:16,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 29.79/20.56 [2019-03-28 12:00:16,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 29.79/20.56 [2019-03-28 12:00:16,130 INFO L133 SettingsManager]: * Rewrite not-equals=true 29.79/20.56 [2019-03-28 12:00:16,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 29.79/20.56 [2019-03-28 12:00:16,131 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 29.79/20.56 [2019-03-28 12:00:16,131 INFO L133 SettingsManager]: * Use SBE=true 29.79/20.56 [2019-03-28 12:00:16,131 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 29.79/20.56 [2019-03-28 12:00:16,131 INFO L133 SettingsManager]: * Use old map elimination=false 29.79/20.56 [2019-03-28 12:00:16,132 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 29.79/20.56 [2019-03-28 12:00:16,132 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 29.79/20.56 [2019-03-28 12:00:16,132 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 29.79/20.56 [2019-03-28 12:00:16,132 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 29.79/20.56 [2019-03-28 12:00:16,132 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 29.79/20.56 [2019-03-28 12:00:16,133 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.56 [2019-03-28 12:00:16,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 29.79/20.56 [2019-03-28 12:00:16,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 29.79/20.56 [2019-03-28 12:00:16,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE 29.79/20.56 [2019-03-28 12:00:16,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 29.79/20.56 [2019-03-28 12:00:16,134 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 29.79/20.56 [2019-03-28 12:00:16,134 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 29.79/20.56 [2019-03-28 12:00:16,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 29.79/20.56 [2019-03-28 12:00:16,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 29.79/20.56 [2019-03-28 12:00:16,134 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 29.79/20.56 [2019-03-28 12:00:16,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 29.79/20.56 [2019-03-28 12:00:16,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 29.79/20.56 [2019-03-28 12:00:16,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 29.79/20.56 [2019-03-28 12:00:16,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 29.79/20.56 [2019-03-28 12:00:16,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 29.79/20.56 [2019-03-28 12:00:16,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 29.79/20.56 [2019-03-28 12:00:16,174 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 29.79/20.56 [2019-03-28 12:00:16,177 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 29.79/20.56 [2019-03-28 12:00:16,178 INFO L271 PluginConnector]: Initializing CDTParser... 29.79/20.56 [2019-03-28 12:00:16,179 INFO L276 PluginConnector]: CDTParser initialized 29.79/20.56 [2019-03-28 12:00:16,180 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 29.79/20.56 [2019-03-28 12:00:16,268 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/f891f3b5522f4fb3ab405d3a9f2632b6/FLAG882f4b43a 29.79/20.56 [2019-03-28 12:00:16,607 INFO L307 CDTParser]: Found 1 translation units. 29.79/20.56 [2019-03-28 12:00:16,607 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 29.79/20.56 [2019-03-28 12:00:16,614 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/f891f3b5522f4fb3ab405d3a9f2632b6/FLAG882f4b43a 29.79/20.56 [2019-03-28 12:00:17,013 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/f891f3b5522f4fb3ab405d3a9f2632b6 29.79/20.56 [2019-03-28 12:00:17,025 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 29.79/20.56 [2019-03-28 12:00:17,026 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 29.79/20.56 [2019-03-28 12:00:17,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 29.79/20.56 [2019-03-28 12:00:17,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 29.79/20.56 [2019-03-28 12:00:17,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 29.79/20.56 [2019-03-28 12:00:17,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f59a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17, skipping insertion in model container 29.79/20.56 [2019-03-28 12:00:17,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 29.79/20.56 [2019-03-28 12:00:17,061 INFO L176 MainTranslator]: Built tables and reachable declarations 29.79/20.56 [2019-03-28 12:00:17,220 INFO L206 PostProcessor]: Analyzing one entry point: main 29.79/20.56 [2019-03-28 12:00:17,225 INFO L191 MainTranslator]: Completed pre-run 29.79/20.56 [2019-03-28 12:00:17,243 INFO L206 PostProcessor]: Analyzing one entry point: main 29.79/20.56 [2019-03-28 12:00:17,258 INFO L195 MainTranslator]: Completed translation 29.79/20.56 [2019-03-28 12:00:17,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17 WrapperNode 29.79/20.56 [2019-03-28 12:00:17,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 29.79/20.56 [2019-03-28 12:00:17,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 29.79/20.56 [2019-03-28 12:00:17,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 29.79/20.56 [2019-03-28 12:00:17,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 29.79/20.56 [2019-03-28 12:00:17,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 29.79/20.56 [2019-03-28 12:00:17,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 29.79/20.56 [2019-03-28 12:00:17,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 29.79/20.56 [2019-03-28 12:00:17,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized 29.79/20.56 [2019-03-28 12:00:17,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 [2019-03-28 12:00:17,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 29.79/20.56 [2019-03-28 12:00:17,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 29.79/20.56 [2019-03-28 12:00:17,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... 29.79/20.56 [2019-03-28 12:00:17,380 INFO L276 PluginConnector]: RCFGBuilder initialized 29.79/20.56 [2019-03-28 12:00:17,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (1/1) ... 29.79/20.56 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.56 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 29.79/20.56 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 29.79/20.56 [2019-03-28 12:00:17,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 29.79/20.56 [2019-03-28 12:00:17,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 29.79/20.56 [2019-03-28 12:00:17,618 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 29.79/20.56 [2019-03-28 12:00:17,619 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 29.79/20.56 [2019-03-28 12:00:17,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:17 BoogieIcfgContainer 29.79/20.56 [2019-03-28 12:00:17,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 29.79/20.56 [2019-03-28 12:00:17,621 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 29.79/20.57 [2019-03-28 12:00:17,621 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 29.79/20.57 [2019-03-28 12:00:17,624 INFO L276 PluginConnector]: BlockEncodingV2 initialized 29.79/20.57 [2019-03-28 12:00:17,625 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:17" (1/1) ... 29.79/20.57 [2019-03-28 12:00:17,644 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 17 edges 29.79/20.57 [2019-03-28 12:00:17,646 INFO L258 BlockEncoder]: Using Remove infeasible edges 29.79/20.57 [2019-03-28 12:00:17,648 INFO L263 BlockEncoder]: Using Maximize final states 29.79/20.57 [2019-03-28 12:00:17,649 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 29.79/20.57 [2019-03-28 12:00:17,649 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 29.79/20.57 [2019-03-28 12:00:17,651 INFO L296 BlockEncoder]: Using Remove sink states 29.79/20.57 [2019-03-28 12:00:17,652 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 29.79/20.57 [2019-03-28 12:00:17,652 INFO L179 BlockEncoder]: Using Rewrite not-equals 29.79/20.57 [2019-03-28 12:00:17,668 INFO L185 BlockEncoder]: Using Use SBE 29.79/20.57 [2019-03-28 12:00:17,683 INFO L200 BlockEncoder]: SBE split 1 edges 29.79/20.57 [2019-03-28 12:00:17,691 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 29.79/20.57 [2019-03-28 12:00:17,693 INFO L71 MaximizeFinalStates]: 0 new accepting states 29.79/20.57 [2019-03-28 12:00:17,706 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 29.79/20.57 [2019-03-28 12:00:17,708 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states 29.79/20.57 [2019-03-28 12:00:17,709 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 29.79/20.57 [2019-03-28 12:00:17,709 INFO L71 MaximizeFinalStates]: 0 new accepting states 29.79/20.57 [2019-03-28 12:00:17,713 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 29.79/20.57 [2019-03-28 12:00:17,713 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 29.79/20.57 [2019-03-28 12:00:17,714 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 29.79/20.57 [2019-03-28 12:00:17,714 INFO L71 MaximizeFinalStates]: 0 new accepting states 29.79/20.57 [2019-03-28 12:00:17,714 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 29.79/20.57 [2019-03-28 12:00:17,714 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 29.79/20.57 [2019-03-28 12:00:17,715 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 6 edges 29.79/20.57 [2019-03-28 12:00:17,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:00:17 BasicIcfg 29.79/20.57 [2019-03-28 12:00:17,715 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 29.79/20.57 [2019-03-28 12:00:17,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 29.79/20.57 [2019-03-28 12:00:17,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... 29.79/20.57 [2019-03-28 12:00:17,720 INFO L276 PluginConnector]: TraceAbstraction initialized 29.79/20.57 [2019-03-28 12:00:17,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:00:17" (1/4) ... 29.79/20.57 [2019-03-28 12:00:17,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e118d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (2/4) ... 29.79/20.57 [2019-03-28 12:00:17,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e118d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:17" (3/4) ... 29.79/20.57 [2019-03-28 12:00:17,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e118d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:00:17" (4/4) ... 29.79/20.57 [2019-03-28 12:00:17,724 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 29.79/20.57 [2019-03-28 12:00:17,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 29.79/20.57 [2019-03-28 12:00:17,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 29.79/20.57 [2019-03-28 12:00:17,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 29.79/20.57 [2019-03-28 12:00:17,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation 29.79/20.57 [2019-03-28 12:00:17,792 INFO L382 AbstractCegarLoop]: Interprodecural is true 29.79/20.57 [2019-03-28 12:00:17,792 INFO L383 AbstractCegarLoop]: Hoare is true 29.79/20.57 [2019-03-28 12:00:17,792 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 29.79/20.57 [2019-03-28 12:00:17,793 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 29.79/20.57 [2019-03-28 12:00:17,793 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 29.79/20.57 [2019-03-28 12:00:17,793 INFO L387 AbstractCegarLoop]: Difference is false 29.79/20.57 [2019-03-28 12:00:17,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 29.79/20.57 [2019-03-28 12:00:17,793 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 29.79/20.57 [2019-03-28 12:00:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 29.79/20.57 [2019-03-28 12:00:17,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 29.79/20.57 [2019-03-28 12:00:17,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 29.79/20.57 [2019-03-28 12:00:17,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 29.79/20.57 [2019-03-28 12:00:17,871 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 25 26) the Hoare annotation is: true 29.79/20.57 [2019-03-28 12:00:17,871 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 22 28) the Hoare annotation is: true 29.79/20.57 [2019-03-28 12:00:17,871 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: true 29.79/20.57 [2019-03-28 12:00:17,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:00:17 BasicIcfg 29.79/20.57 [2019-03-28 12:00:17,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 29.79/20.57 [2019-03-28 12:00:17,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 29.79/20.57 [2019-03-28 12:00:17,881 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 29.79/20.57 [2019-03-28 12:00:17,884 INFO L276 PluginConnector]: BuchiAutomizer initialized 29.79/20.57 [2019-03-28 12:00:17,885 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.79/20.57 [2019-03-28 12:00:17,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:00:17" (1/5) ... 29.79/20.57 [2019-03-28 12:00:17,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5698cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.79/20.57 [2019-03-28 12:00:17,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:00:17" (2/5) ... 29.79/20.57 [2019-03-28 12:00:17,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5698cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.79/20.57 [2019-03-28 12:00:17,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:00:17" (3/5) ... 29.79/20.57 [2019-03-28 12:00:17,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5698cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.79/20.57 [2019-03-28 12:00:17,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:00:17" (4/5) ... 29.79/20.57 [2019-03-28 12:00:17,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5698cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:00:17, skipping insertion in model container 29.79/20.57 [2019-03-28 12:00:17,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 29.79/20.57 [2019-03-28 12:00:17,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:00:17" (5/5) ... 29.79/20.57 [2019-03-28 12:00:17,890 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 29.79/20.57 [2019-03-28 12:00:17,918 INFO L133 ementStrategyFactory]: Using default assertion order modulation 29.79/20.57 [2019-03-28 12:00:17,918 INFO L374 BuchiCegarLoop]: Interprodecural is true 29.79/20.57 [2019-03-28 12:00:17,919 INFO L375 BuchiCegarLoop]: Hoare is true 29.79/20.57 [2019-03-28 12:00:17,919 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 29.79/20.57 [2019-03-28 12:00:17,919 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 29.79/20.57 [2019-03-28 12:00:17,919 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 29.79/20.57 [2019-03-28 12:00:17,919 INFO L379 BuchiCegarLoop]: Difference is false 29.79/20.57 [2019-03-28 12:00:17,919 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 29.79/20.57 [2019-03-28 12:00:17,919 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 29.79/20.57 [2019-03-28 12:00:17,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 29.79/20.57 [2019-03-28 12:00:17,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 29.79/20.57 [2019-03-28 12:00:17,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.79/20.57 [2019-03-28 12:00:17,940 INFO L119 BuchiIsEmpty]: Starting construction of run 29.79/20.57 [2019-03-28 12:00:17,946 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 29.79/20.57 [2019-03-28 12:00:17,946 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 29.79/20.57 [2019-03-28 12:00:17,946 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 29.79/20.57 [2019-03-28 12:00:17,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 29.79/20.57 [2019-03-28 12:00:17,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 29.79/20.57 [2019-03-28 12:00:17,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.79/20.57 [2019-03-28 12:00:17,947 INFO L119 BuchiIsEmpty]: Starting construction of run 29.79/20.57 [2019-03-28 12:00:17,948 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 29.79/20.57 [2019-03-28 12:00:17,948 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 29.79/20.57 [2019-03-28 12:00:17,953 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 5#L20-2true 29.79/20.57 [2019-03-28 12:00:17,953 INFO L796 eck$LassoCheckResult]: Loop: 5#L20-2true [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 6#L22-2true [75] L22-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11) (<= v_ULTIMATE.start_main_~m~0_8 v_ULTIMATE.start_main_~j~0_8)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6] 5#L20-2true 29.79/20.57 [2019-03-28 12:00:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:17,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:17,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:17,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:17,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2927, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:18,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:18,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:18,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash 106715, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:18,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:18,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,120 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:18,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:18,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:18,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:18,122 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.79/20.57 [2019-03-28 12:00:18,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:18,122 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:18,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 29.79/20.57 [2019-03-28 12:00:18,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:18,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,219 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:18,220 INFO L412 LassoAnalysis]: Checking for nontermination... 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:18,228 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:18,262 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:18,439 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.79/20.57 [2019-03-28 12:00:18,442 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:18,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:18,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:18,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:18,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.79/20.57 [2019-03-28 12:00:18,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:18,443 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:18,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 29.79/20.57 [2019-03-28 12:00:18,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:18,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:18,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,501 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:18,507 INFO L497 LassoAnalysis]: Using template 'affine'. 29.79/20.57 [2019-03-28 12:00:18,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:18,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:18,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:18,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:18,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:18,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:18,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:18,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:18,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.79/20.57 [2019-03-28 12:00:18,532 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.79/20.57 [2019-03-28 12:00:18,532 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 29.79/20.57 [2019-03-28 12:00:18,534 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.79/20.57 [2019-03-28 12:00:18,534 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.79/20.57 [2019-03-28 12:00:18,535 INFO L518 LassoAnalysis]: Proved termination. 29.79/20.57 [2019-03-28 12:00:18,536 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.79/20.57 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 29.79/20.57 Supporting invariants [] 29.79/20.57 [2019-03-28 12:00:18,537 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.79/20.57 [2019-03-28 12:00:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:18,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:18,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:18,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:18,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.79/20.57 [2019-03-28 12:00:18,647 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 29.79/20.57 [2019-03-28 12:00:18,653 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 29.79/20.57 [2019-03-28 12:00:18,654 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 29.79/20.57 [2019-03-28 12:00:18,690 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 16 transitions. Complement of second has 4 states. 29.79/20.57 [2019-03-28 12:00:18,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 29.79/20.57 [2019-03-28 12:00:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 29.79/20.57 [2019-03-28 12:00:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. 29.79/20.57 [2019-03-28 12:00:18,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. 29.79/20.57 [2019-03-28 12:00:18,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:18,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 16 transitions. 29.79/20.57 [2019-03-28 12:00:18,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 29.79/20.57 [2019-03-28 12:00:18,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:18,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 29.79/20.57 [2019-03-28 12:00:18,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 29.79/20.57 [2019-03-28 12:00:18,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:18,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.79/20.57 [2019-03-28 12:00:18,712 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. 29.79/20.57 [2019-03-28 12:00:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 29.79/20.57 [2019-03-28 12:00:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 29.79/20.57 [2019-03-28 12:00:18,743 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 29.79/20.57 [2019-03-28 12:00:18,743 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. 29.79/20.57 [2019-03-28 12:00:18,743 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 29.79/20.57 [2019-03-28 12:00:18,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. 29.79/20.57 [2019-03-28 12:00:18,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 29.79/20.57 [2019-03-28 12:00:18,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.79/20.57 [2019-03-28 12:00:18,744 INFO L119 BuchiIsEmpty]: Starting construction of run 29.79/20.57 [2019-03-28 12:00:18,745 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 29.79/20.57 [2019-03-28 12:00:18,745 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 29.79/20.57 [2019-03-28 12:00:18,745 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 48#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 54#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 49#L25-2 29.79/20.57 [2019-03-28 12:00:18,746 INFO L796 eck$LassoCheckResult]: Loop: 49#L25-2 [56] L25-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~k~0_8 v_ULTIMATE.start_main_~N~0_7) (= v_ULTIMATE.start_main_~k~0_7 (+ v_ULTIMATE.start_main_~k~0_8 1))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_8, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 49#L25-2 29.79/20.57 [2019-03-28 12:00:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:18,746 INFO L82 PathProgramCache]: Analyzing trace with hash 106706, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:18,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:18,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:18,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:18,758 INFO L82 PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:18,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:18,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:18,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 3307942, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:18,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:18,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:18,788 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:18,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:18,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:18,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:18,788 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.79/20.57 [2019-03-28 12:00:18,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:18,789 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:18,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 29.79/20.57 [2019-03-28 12:00:18,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:18,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:18,817 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:18,817 INFO L412 LassoAnalysis]: Checking for nontermination... 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:18,822 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:18,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:18,853 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:19,064 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.79/20.57 [2019-03-28 12:00:19,066 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:19,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:19,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:19,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:19,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.79/20.57 [2019-03-28 12:00:19,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:19,067 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:19,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 29.79/20.57 [2019-03-28 12:00:19,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:19,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:19,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,089 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:19,089 INFO L497 LassoAnalysis]: Using template 'affine'. 29.79/20.57 [2019-03-28 12:00:19,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:19,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:19,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:19,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:19,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:19,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:19,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:19,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:19,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.79/20.57 [2019-03-28 12:00:19,105 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.79/20.57 [2019-03-28 12:00:19,106 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 29.79/20.57 [2019-03-28 12:00:19,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.79/20.57 [2019-03-28 12:00:19,106 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.79/20.57 [2019-03-28 12:00:19,106 INFO L518 LassoAnalysis]: Proved termination. 29.79/20.57 [2019-03-28 12:00:19,106 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.79/20.57 Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 29.79/20.57 Supporting invariants [] 29.79/20.57 [2019-03-28 12:00:19,107 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.79/20.57 [2019-03-28 12:00:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:19,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:19,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:19,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:19,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.79/20.57 [2019-03-28 12:00:19,132 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 29.79/20.57 [2019-03-28 12:00:19,132 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 29.79/20.57 [2019-03-28 12:00:19,132 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 2 states. 29.79/20.57 [2019-03-28 12:00:19,142 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 2 states. Result 12 states and 20 transitions. Complement of second has 4 states. 29.79/20.57 [2019-03-28 12:00:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 29.79/20.57 [2019-03-28 12:00:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 29.79/20.57 [2019-03-28 12:00:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. 29.79/20.57 [2019-03-28 12:00:19,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 1 letters. 29.79/20.57 [2019-03-28 12:00:19,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:19,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 1 letters. 29.79/20.57 [2019-03-28 12:00:19,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:19,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:19,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:19,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 20 transitions. 29.79/20.57 [2019-03-28 12:00:19,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 29.79/20.57 [2019-03-28 12:00:19,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 16 transitions. 29.79/20.57 [2019-03-28 12:00:19,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 29.79/20.57 [2019-03-28 12:00:19,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 29.79/20.57 [2019-03-28 12:00:19,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 16 transitions. 29.79/20.57 [2019-03-28 12:00:19,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.79/20.57 [2019-03-28 12:00:19,149 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 16 transitions. 29.79/20.57 [2019-03-28 12:00:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 16 transitions. 29.79/20.57 [2019-03-28 12:00:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 29.79/20.57 [2019-03-28 12:00:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 29.79/20.57 [2019-03-28 12:00:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:19,150 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:19,151 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:19,151 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 29.79/20.57 [2019-03-28 12:00:19,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. 29.79/20.57 [2019-03-28 12:00:19,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 29.79/20.57 [2019-03-28 12:00:19,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.79/20.57 [2019-03-28 12:00:19,152 INFO L119 BuchiIsEmpty]: Starting construction of run 29.79/20.57 [2019-03-28 12:00:19,152 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 29.79/20.57 [2019-03-28 12:00:19,152 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 29.79/20.57 [2019-03-28 12:00:19,152 INFO L794 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 99#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 106#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 100#L25-2 29.79/20.57 [2019-03-28 12:00:19,153 INFO L796 eck$LassoCheckResult]: Loop: 100#L25-2 [77] L25-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_8 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 102#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 100#L25-2 29.79/20.57 [2019-03-28 12:00:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash 106706, now seen corresponding path program 2 times 29.79/20.57 [2019-03-28 12:00:19,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 3414, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:19,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 102546919, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:19,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:19,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,217 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:19,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:19,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:19,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:19,218 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.79/20.57 [2019-03-28 12:00:19,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:19,218 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:19,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 29.79/20.57 [2019-03-28 12:00:19,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:19,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:19,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,282 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:19,282 INFO L412 LassoAnalysis]: Checking for nontermination... 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:19,288 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:19,324 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:19,531 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.79/20.57 [2019-03-28 12:00:19,534 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:19,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:19,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:19,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:19,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.79/20.57 [2019-03-28 12:00:19,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:19,536 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:19,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 29.79/20.57 [2019-03-28 12:00:19,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:19,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:19,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,587 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:19,587 INFO L497 LassoAnalysis]: Using template 'affine'. 29.79/20.57 [2019-03-28 12:00:19,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:19,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:19,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:19,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:19,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:19,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:19,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:19,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:19,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.79/20.57 [2019-03-28 12:00:19,599 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.79/20.57 [2019-03-28 12:00:19,599 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 29.79/20.57 [2019-03-28 12:00:19,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.79/20.57 [2019-03-28 12:00:19,600 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.79/20.57 [2019-03-28 12:00:19,600 INFO L518 LassoAnalysis]: Proved termination. 29.79/20.57 [2019-03-28 12:00:19,601 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.79/20.57 Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 29.79/20.57 Supporting invariants [] 29.79/20.57 [2019-03-28 12:00:19,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.79/20.57 [2019-03-28 12:00:19,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:19,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:19,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:19,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:19,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.79/20.57 [2019-03-28 12:00:19,634 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 29.79/20.57 [2019-03-28 12:00:19,634 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 29.79/20.57 [2019-03-28 12:00:19,634 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand 3 states. 29.79/20.57 [2019-03-28 12:00:19,647 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 17 states and 29 transitions. Complement of second has 4 states. 29.79/20.57 [2019-03-28 12:00:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 29.79/20.57 [2019-03-28 12:00:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 29.79/20.57 [2019-03-28 12:00:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. 29.79/20.57 [2019-03-28 12:00:19,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:19,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:19,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:19,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:19,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 4 letters. 29.79/20.57 [2019-03-28 12:00:19,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:19,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 29 transitions. 29.79/20.57 [2019-03-28 12:00:19,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 29.79/20.57 [2019-03-28 12:00:19,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 28 transitions. 29.79/20.57 [2019-03-28 12:00:19,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 29.79/20.57 [2019-03-28 12:00:19,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 29.79/20.57 [2019-03-28 12:00:19,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 28 transitions. 29.79/20.57 [2019-03-28 12:00:19,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.79/20.57 [2019-03-28 12:00:19,653 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 28 transitions. 29.79/20.57 [2019-03-28 12:00:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 28 transitions. 29.79/20.57 [2019-03-28 12:00:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. 29.79/20.57 [2019-03-28 12:00:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 29.79/20.57 [2019-03-28 12:00:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. 29.79/20.57 [2019-03-28 12:00:19,656 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 29.79/20.57 [2019-03-28 12:00:19,656 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. 29.79/20.57 [2019-03-28 12:00:19,656 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 29.79/20.57 [2019-03-28 12:00:19,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 24 transitions. 29.79/20.57 [2019-03-28 12:00:19,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 29.79/20.57 [2019-03-28 12:00:19,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.79/20.57 [2019-03-28 12:00:19,657 INFO L119 BuchiIsEmpty]: Starting construction of run 29.79/20.57 [2019-03-28 12:00:19,658 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 29.79/20.57 [2019-03-28 12:00:19,658 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 29.79/20.57 [2019-03-28 12:00:19,658 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 159#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 169#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 160#L25-2 29.79/20.57 [2019-03-28 12:00:19,658 INFO L796 eck$LassoCheckResult]: Loop: 160#L25-2 [77] L25-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_8 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 164#L22-2 [75] L22-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11) (<= v_ULTIMATE.start_main_~m~0_8 v_ULTIMATE.start_main_~j~0_8)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6] 165#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 166#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 160#L25-2 29.79/20.57 [2019-03-28 12:00:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash 106706, now seen corresponding path program 3 times 29.79/20.57 [2019-03-28 12:00:19,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:19,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 3291460, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:19,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:19,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash -236648043, now seen corresponding path program 1 times 29.79/20.57 [2019-03-28 12:00:19,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:19,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:19,727 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:19,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:19,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:19,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:19,728 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.79/20.57 [2019-03-28 12:00:19,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:19,728 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:19,729 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 29.79/20.57 [2019-03-28 12:00:19,729 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:19,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:19,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:19,805 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:19,805 INFO L412 LassoAnalysis]: Checking for nontermination... 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:19,813 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:19,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:19,850 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:31,886 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 29.79/20.57 [2019-03-28 12:00:31,890 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:31,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:31,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:31,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:31,904 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.79/20.57 [2019-03-28 12:00:31,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:31,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:31,904 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:31,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 29.79/20.57 [2019-03-28 12:00:31,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:31,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:31,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:31,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:31,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:31,969 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:31,969 INFO L497 LassoAnalysis]: Using template 'affine'. 29.79/20.57 [2019-03-28 12:00:31,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:31,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:31,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:31,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:31,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:31,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:31,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:31,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:31,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 29.79/20.57 [2019-03-28 12:00:31,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:31,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:31,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:31,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:31,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:31,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:31,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:31,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:31,981 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.79/20.57 [2019-03-28 12:00:31,986 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.79/20.57 [2019-03-28 12:00:31,987 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 29.79/20.57 [2019-03-28 12:00:31,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.79/20.57 [2019-03-28 12:00:31,987 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.79/20.57 [2019-03-28 12:00:31,987 INFO L518 LassoAnalysis]: Proved termination. 29.79/20.57 [2019-03-28 12:00:31,987 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.79/20.57 Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~k~0 29.79/20.57 Supporting invariants [] 29.79/20.57 [2019-03-28 12:00:31,988 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.79/20.57 [2019-03-28 12:00:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:32,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:32,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:32,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:32,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.79/20.57 [2019-03-28 12:00:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,072 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 29.79/20.57 [2019-03-28 12:00:32,073 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 29.79/20.57 [2019-03-28 12:00:32,073 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 29.79/20.57 [2019-03-28 12:00:32,073 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13 Second operand 5 states. 29.79/20.57 [2019-03-28 12:00:32,245 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 92 transitions. Complement of second has 22 states. 29.79/20.57 [2019-03-28 12:00:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states 29.79/20.57 [2019-03-28 12:00:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 29.79/20.57 [2019-03-28 12:00:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. 29.79/20.57 [2019-03-28 12:00:32,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 4 letters. 29.79/20.57 [2019-03-28 12:00:32,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:32,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. 29.79/20.57 [2019-03-28 12:00:32,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:32,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 8 letters. 29.79/20.57 [2019-03-28 12:00:32,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:32,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 92 transitions. 29.79/20.57 [2019-03-28 12:00:32,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 29.79/20.57 [2019-03-28 12:00:32,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 35 states and 74 transitions. 29.79/20.57 [2019-03-28 12:00:32,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 29.79/20.57 [2019-03-28 12:00:32,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 29.79/20.57 [2019-03-28 12:00:32,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 74 transitions. 29.79/20.57 [2019-03-28 12:00:32,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 29.79/20.57 [2019-03-28 12:00:32,259 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 74 transitions. 29.79/20.57 [2019-03-28 12:00:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 74 transitions. 29.79/20.57 [2019-03-28 12:00:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. 29.79/20.57 [2019-03-28 12:00:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 29.79/20.57 [2019-03-28 12:00:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. 29.79/20.57 [2019-03-28 12:00:32,264 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. 29.79/20.57 [2019-03-28 12:00:32,264 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. 29.79/20.57 [2019-03-28 12:00:32,264 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 29.79/20.57 [2019-03-28 12:00:32,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. 29.79/20.57 [2019-03-28 12:00:32,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 29.79/20.57 [2019-03-28 12:00:32,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 29.79/20.57 [2019-03-28 12:00:32,265 INFO L119 BuchiIsEmpty]: Starting construction of run 29.79/20.57 [2019-03-28 12:00:32,265 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 29.79/20.57 [2019-03-28 12:00:32,266 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 29.79/20.57 [2019-03-28 12:00:32,266 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 291#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 305#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 292#L25-2 [77] L25-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_8 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 300#L22-2 29.79/20.57 [2019-03-28 12:00:32,266 INFO L796 eck$LassoCheckResult]: Loop: 300#L22-2 [75] L22-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11) (<= v_ULTIMATE.start_main_~m~0_8 v_ULTIMATE.start_main_~j~0_8)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6] 301#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 300#L22-2 29.79/20.57 [2019-03-28 12:00:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash 3307963, now seen corresponding path program 2 times 29.79/20.57 [2019-03-28 12:00:32,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:32,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash 3347, now seen corresponding path program 2 times 29.79/20.57 [2019-03-28 12:00:32,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:32,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:32,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1116012467, now seen corresponding path program 2 times 29.79/20.57 [2019-03-28 12:00:32,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 29.79/20.57 [2019-03-28 12:00:32,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 29.79/20.57 [2019-03-28 12:00:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 29.79/20.57 [2019-03-28 12:00:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 29.79/20.57 [2019-03-28 12:00:32,322 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:32,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:32,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:32,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:32,323 INFO L127 ssoRankerPreferences]: Use exernal solver: true 29.79/20.57 [2019-03-28 12:00:32,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:32,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:32,323 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:32,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 29.79/20.57 [2019-03-28 12:00:32,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:32,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:32,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:32,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:32,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:32,360 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:32,360 INFO L412 LassoAnalysis]: Checking for nontermination... 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:32,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:32,365 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:32,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. 29.79/20.57 [2019-03-28 12:00:32,370 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:32,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:32,399 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:32,403 INFO L445 LassoAnalysis]: Proved nontermination for one component. 29.79/20.57 [2019-03-28 12:00:32,403 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:32,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:32,431 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 29.79/20.57 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 29.79/20.57 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:32,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 29.79/20.57 [2019-03-28 12:00:32,462 INFO L163 nArgumentSynthesizer]: Using integer mode. 29.79/20.57 [2019-03-28 12:00:33,154 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 29.79/20.57 [2019-03-28 12:00:33,157 INFO L216 LassoAnalysis]: Preferences: 29.79/20.57 [2019-03-28 12:00:33,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 29.79/20.57 [2019-03-28 12:00:33,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 29.79/20.57 [2019-03-28 12:00:33,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 29.79/20.57 [2019-03-28 12:00:33,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false 29.79/20.57 [2019-03-28 12:00:33,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 29.79/20.57 [2019-03-28 12:00:33,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 29.79/20.57 [2019-03-28 12:00:33,158 INFO L130 ssoRankerPreferences]: Path of dumped script: 29.79/20.57 [2019-03-28 12:00:33,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 29.79/20.57 [2019-03-28 12:00:33,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 29.79/20.57 [2019-03-28 12:00:33,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 29.79/20.57 [2019-03-28 12:00:33,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:33,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:33,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 29.79/20.57 [2019-03-28 12:00:33,199 INFO L300 LassoAnalysis]: Preprocessing complete. 29.79/20.57 [2019-03-28 12:00:33,199 INFO L497 LassoAnalysis]: Using template 'affine'. 29.79/20.57 [2019-03-28 12:00:33,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:33,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:33,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:33,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:33,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:33,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:33,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:33,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:33,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 29.79/20.57 [2019-03-28 12:00:33,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:33,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:33,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:33,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:33,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:33,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:33,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:33,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:33,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 29.79/20.57 [2019-03-28 12:00:33,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 29.79/20.57 Termination analysis: LINEAR_WITH_GUESSES 29.79/20.57 Number of strict supporting invariants: 0 29.79/20.57 Number of non-strict supporting invariants: 1 29.79/20.57 Consider only non-deceasing supporting invariants: true 29.79/20.57 Simplify termination arguments: true 29.79/20.57 Simplify supporting invariants: trueOverapproximate stem: false 29.79/20.57 [2019-03-28 12:00:33,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. 29.79/20.57 [2019-03-28 12:00:33,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 29.79/20.57 [2019-03-28 12:00:33,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 29.79/20.57 [2019-03-28 12:00:33,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 29.79/20.57 [2019-03-28 12:00:33,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 29.79/20.57 [2019-03-28 12:00:33,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 29.79/20.57 [2019-03-28 12:00:33,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 29.79/20.57 [2019-03-28 12:00:33,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 29.79/20.57 [2019-03-28 12:00:33,214 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 29.79/20.57 [2019-03-28 12:00:33,214 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 29.79/20.57 [2019-03-28 12:00:33,215 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 29.79/20.57 [2019-03-28 12:00:33,215 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 29.79/20.57 [2019-03-28 12:00:33,215 INFO L518 LassoAnalysis]: Proved termination. 29.79/20.57 [2019-03-28 12:00:33,215 INFO L520 LassoAnalysis]: Termination argument consisting of: 29.79/20.57 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 29.79/20.57 Supporting invariants [] 29.79/20.57 [2019-03-28 12:00:33,216 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 29.79/20.57 [2019-03-28 12:00:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 29.79/20.57 [2019-03-28 12:00:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:33,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:33,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 29.79/20.57 [2019-03-28 12:00:33,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 29.79/20.57 [2019-03-28 12:00:33,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... 29.79/20.57 [2019-03-28 12:00:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 29.79/20.57 [2019-03-28 12:00:33,252 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 29.79/20.57 [2019-03-28 12:00:33,252 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 29.79/20.57 [2019-03-28 12:00:33,252 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32 Second operand 3 states. 29.79/20.57 [2019-03-28 12:00:33,276 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32. Second operand 3 states. Result 34 states and 75 transitions. Complement of second has 6 states. 29.79/20.57 [2019-03-28 12:00:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 29.79/20.57 [2019-03-28 12:00:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 29.79/20.57 [2019-03-28 12:00:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. 29.79/20.57 [2019-03-28 12:00:33,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. 29.79/20.57 [2019-03-28 12:00:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. 29.79/20.57 [2019-03-28 12:00:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. 29.79/20.57 [2019-03-28 12:00:33,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 75 transitions. 29.79/20.57 [2019-03-28 12:00:33,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 29.79/20.57 [2019-03-28 12:00:33,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. 29.79/20.57 [2019-03-28 12:00:33,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 29.79/20.57 [2019-03-28 12:00:33,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 29.79/20.57 [2019-03-28 12:00:33,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 29.79/20.57 [2019-03-28 12:00:33,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 29.79/20.57 [2019-03-28 12:00:33,282 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.79/20.57 [2019-03-28 12:00:33,282 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.79/20.57 [2019-03-28 12:00:33,282 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 29.79/20.57 [2019-03-28 12:00:33,282 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 29.79/20.57 [2019-03-28 12:00:33,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 29.79/20.57 [2019-03-28 12:00:33,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 29.79/20.57 [2019-03-28 12:00:33,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 29.79/20.57 [2019-03-28 12:00:33,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:00:33 BasicIcfg 29.79/20.57 [2019-03-28 12:00:33,289 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 29.79/20.57 [2019-03-28 12:00:33,289 INFO L168 Benchmark]: Toolchain (without parser) took 16264.14 ms. Allocated memory was 649.6 MB in the beginning and 751.3 MB in the end (delta: 101.7 MB). Free memory was 564.0 MB in the beginning and 645.7 MB in the end (delta: -81.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,291 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.98 ms. Allocated memory is still 649.6 MB. Free memory was 564.0 MB in the beginning and 554.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.11 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 554.4 MB in the beginning and 656.0 MB in the end (delta: -101.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,293 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 688.4 MB. Free memory was 656.0 MB in the beginning and 652.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,293 INFO L168 Benchmark]: RCFGBuilder took 240.30 ms. Allocated memory is still 688.4 MB. Free memory was 652.8 MB in the beginning and 636.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,294 INFO L168 Benchmark]: BlockEncodingV2 took 94.59 ms. Allocated memory is still 688.4 MB. Free memory was 636.0 MB in the beginning and 630.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,294 INFO L168 Benchmark]: TraceAbstraction took 163.72 ms. Allocated memory is still 688.4 MB. Free memory was 629.3 MB in the beginning and 621.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,295 INFO L168 Benchmark]: BuchiAutomizer took 15408.45 ms. Allocated memory was 688.4 MB in the beginning and 751.3 MB in the end (delta: 62.9 MB). Free memory was 619.9 MB in the beginning and 645.7 MB in the end (delta: -25.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 50.3 GB. 29.79/20.57 [2019-03-28 12:00:33,300 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 29.79/20.57 --- Results --- 29.79/20.57 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 29.79/20.57 - StatisticsResult: Initial Icfg 29.79/20.57 11 locations, 17 edges 29.79/20.57 - StatisticsResult: Encoded RCFG 29.79/20.57 4 locations, 6 edges 29.79/20.57 * Results from de.uni_freiburg.informatik.ultimate.core: 29.79/20.57 - StatisticsResult: Toolchain Benchmarks 29.79/20.57 Benchmark results are: 29.79/20.57 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 29.79/20.57 * CACSL2BoogieTranslator took 231.98 ms. Allocated memory is still 649.6 MB. Free memory was 564.0 MB in the beginning and 554.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 50.3 GB. 29.79/20.57 * Boogie Procedure Inliner took 98.11 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 554.4 MB in the beginning and 656.0 MB in the end (delta: -101.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 50.3 GB. 29.79/20.57 * Boogie Preprocessor took 21.50 ms. Allocated memory is still 688.4 MB. Free memory was 656.0 MB in the beginning and 652.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 29.79/20.57 * RCFGBuilder took 240.30 ms. Allocated memory is still 688.4 MB. Free memory was 652.8 MB in the beginning and 636.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 50.3 GB. 29.79/20.57 * BlockEncodingV2 took 94.59 ms. Allocated memory is still 688.4 MB. Free memory was 636.0 MB in the beginning and 630.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 29.79/20.57 * TraceAbstraction took 163.72 ms. Allocated memory is still 688.4 MB. Free memory was 629.3 MB in the beginning and 621.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 29.79/20.57 * BuchiAutomizer took 15408.45 ms. Allocated memory was 688.4 MB in the beginning and 751.3 MB in the end (delta: 62.9 MB). Free memory was 619.9 MB in the beginning and 645.7 MB in the end (delta: -25.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 50.3 GB. 29.79/20.57 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 29.79/20.57 - AllSpecificationsHoldResult: All specifications hold 29.79/20.57 We were not able to verify any specifiation because the program does not contain any specification. 29.79/20.57 - InvariantResult [Line: 25]: Loop Invariant 29.79/20.57 Derived loop invariant: 1 29.79/20.57 - InvariantResult [Line: 20]: Loop Invariant 29.79/20.57 Derived loop invariant: 1 29.79/20.57 - InvariantResult [Line: 22]: Loop Invariant 29.79/20.57 Derived loop invariant: 1 29.79/20.57 - StatisticsResult: Ultimate Automizer benchmark data 29.79/20.57 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 3 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 29.79/20.57 - StatisticsResult: Constructed decomposition of program 29.79/20.57 Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function n + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 3 locations. One nondeterministic module has affine ranking function -1 * j + m and consists of 3 locations. One nondeterministic module has affine ranking function n + -1 * k and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 4 locations. 29.79/20.57 - StatisticsResult: Timing statistics 29.79/20.57 BüchiAutomizer plugin needed 15.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 14.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 40 SDtfs, 47 SDslu, 7 SDs, 0 SdLazy, 65 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp69 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf92 smp100 dnf100 smp100 tf112 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.5s 29.79/20.57 - TerminationAnalysisResult: Termination proven 29.79/20.57 Buchi Automizer proved that your program is terminating 29.79/20.57 RESULT: Ultimate proved your program to be correct! 29.79/20.57 !SESSION 2019-03-28 12:00:13.777 ----------------------------------------------- 29.79/20.57 eclipse.buildId=unknown 29.79/20.57 java.version=1.8.0_181 29.79/20.57 java.vendor=Oracle Corporation 29.79/20.57 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 29.79/20.57 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 29.79/20.57 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 29.79/20.57 29.79/20.57 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:00:33.534 29.79/20.57 !MESSAGE The workspace will exit with unsaved changes in this session. 29.79/20.57 Received shutdown request... 29.79/20.57 Ultimate: 29.79/20.57 GTK+ Version Check 29.79/20.57 EOF