30.19/12.85 YES 30.19/12.85 30.19/12.85 Ultimate: Cannot open display: 30.19/12.85 This is Ultimate 0.1.24-8dc7c08-m 30.19/12.85 [2019-03-28 12:20:30,635 INFO L170 SettingsManager]: Resetting all preferences to default values... 30.19/12.85 [2019-03-28 12:20:30,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 30.19/12.85 [2019-03-28 12:20:30,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 30.19/12.85 [2019-03-28 12:20:30,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 30.19/12.85 [2019-03-28 12:20:30,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 30.19/12.85 [2019-03-28 12:20:30,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 30.19/12.85 [2019-03-28 12:20:30,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 30.19/12.85 [2019-03-28 12:20:30,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 30.19/12.85 [2019-03-28 12:20:30,655 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 30.19/12.85 [2019-03-28 12:20:30,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 30.19/12.85 [2019-03-28 12:20:30,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 30.19/12.85 [2019-03-28 12:20:30,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 30.19/12.85 [2019-03-28 12:20:30,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 30.19/12.85 [2019-03-28 12:20:30,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 30.19/12.85 [2019-03-28 12:20:30,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 30.19/12.85 [2019-03-28 12:20:30,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 30.19/12.85 [2019-03-28 12:20:30,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 30.19/12.85 [2019-03-28 12:20:30,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 30.19/12.85 [2019-03-28 12:20:30,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 30.19/12.85 [2019-03-28 12:20:30,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 30.19/12.85 [2019-03-28 12:20:30,671 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 30.19/12.85 [2019-03-28 12:20:30,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 30.19/12.85 [2019-03-28 12:20:30,672 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 30.19/12.85 [2019-03-28 12:20:30,673 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 30.19/12.85 [2019-03-28 12:20:30,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 30.19/12.85 [2019-03-28 12:20:30,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 30.19/12.85 [2019-03-28 12:20:30,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 30.19/12.85 [2019-03-28 12:20:30,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 30.19/12.85 [2019-03-28 12:20:30,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 30.19/12.85 [2019-03-28 12:20:30,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 30.19/12.85 [2019-03-28 12:20:30,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 30.19/12.85 [2019-03-28 12:20:30,678 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 30.19/12.85 [2019-03-28 12:20:30,692 INFO L110 SettingsManager]: Loading preferences was successful 30.19/12.85 [2019-03-28 12:20:30,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 30.19/12.85 [2019-03-28 12:20:30,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 30.19/12.85 [2019-03-28 12:20:30,694 INFO L133 SettingsManager]: * Rewrite not-equals=true 30.19/12.85 [2019-03-28 12:20:30,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 30.19/12.85 [2019-03-28 12:20:30,694 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 30.19/12.85 [2019-03-28 12:20:30,694 INFO L133 SettingsManager]: * Use SBE=true 30.19/12.85 [2019-03-28 12:20:30,694 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 30.19/12.85 [2019-03-28 12:20:30,695 INFO L133 SettingsManager]: * Use old map elimination=false 30.19/12.85 [2019-03-28 12:20:30,695 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 30.19/12.85 [2019-03-28 12:20:30,695 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 30.19/12.85 [2019-03-28 12:20:30,695 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 30.19/12.85 [2019-03-28 12:20:30,695 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 30.19/12.85 [2019-03-28 12:20:30,696 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 30.19/12.85 [2019-03-28 12:20:30,696 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.85 [2019-03-28 12:20:30,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 30.19/12.85 [2019-03-28 12:20:30,696 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 30.19/12.85 [2019-03-28 12:20:30,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE 30.19/12.85 [2019-03-28 12:20:30,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 30.19/12.85 [2019-03-28 12:20:30,697 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 30.19/12.85 [2019-03-28 12:20:30,697 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 30.19/12.85 [2019-03-28 12:20:30,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 30.19/12.85 [2019-03-28 12:20:30,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 30.19/12.85 [2019-03-28 12:20:30,697 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 30.19/12.85 [2019-03-28 12:20:30,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.19/12.85 [2019-03-28 12:20:30,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 30.19/12.85 [2019-03-28 12:20:30,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 30.19/12.85 [2019-03-28 12:20:30,698 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 30.19/12.85 [2019-03-28 12:20:30,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 30.19/12.85 [2019-03-28 12:20:30,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 30.19/12.85 [2019-03-28 12:20:30,737 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 30.19/12.85 [2019-03-28 12:20:30,740 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 30.19/12.85 [2019-03-28 12:20:30,741 INFO L271 PluginConnector]: Initializing CDTParser... 30.19/12.85 [2019-03-28 12:20:30,742 INFO L276 PluginConnector]: CDTParser initialized 30.19/12.85 [2019-03-28 12:20:30,742 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 30.19/12.85 [2019-03-28 12:20:30,844 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/633cd558237f49ab9210e8acbaff177f/FLAGcdda60199 30.19/12.85 [2019-03-28 12:20:31,180 INFO L307 CDTParser]: Found 1 translation units. 30.19/12.85 [2019-03-28 12:20:31,180 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 30.19/12.85 [2019-03-28 12:20:31,187 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/633cd558237f49ab9210e8acbaff177f/FLAGcdda60199 30.19/12.85 [2019-03-28 12:20:31,638 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/633cd558237f49ab9210e8acbaff177f 30.19/12.85 [2019-03-28 12:20:31,649 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 30.19/12.85 [2019-03-28 12:20:31,651 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 30.19/12.85 [2019-03-28 12:20:31,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 30.19/12.85 [2019-03-28 12:20:31,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 30.19/12.85 [2019-03-28 12:20:31,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 30.19/12.85 [2019-03-28 12:20:31,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d80dc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:31,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 30.19/12.85 [2019-03-28 12:20:31,685 INFO L176 MainTranslator]: Built tables and reachable declarations 30.19/12.85 [2019-03-28 12:20:31,843 INFO L206 PostProcessor]: Analyzing one entry point: main 30.19/12.85 [2019-03-28 12:20:31,848 INFO L191 MainTranslator]: Completed pre-run 30.19/12.85 [2019-03-28 12:20:31,864 INFO L206 PostProcessor]: Analyzing one entry point: main 30.19/12.85 [2019-03-28 12:20:31,941 INFO L195 MainTranslator]: Completed translation 30.19/12.85 [2019-03-28 12:20:31,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31 WrapperNode 30.19/12.85 [2019-03-28 12:20:31,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 30.19/12.85 [2019-03-28 12:20:31,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 30.19/12.85 [2019-03-28 12:20:31,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 30.19/12.85 [2019-03-28 12:20:31,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 30.19/12.85 [2019-03-28 12:20:31,953 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:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,959 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:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 30.19/12.85 [2019-03-28 12:20:31,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 30.19/12.85 [2019-03-28 12:20:31,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 30.19/12.85 [2019-03-28 12:20:31,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized 30.19/12.85 [2019-03-28 12:20:31,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 [2019-03-28 12:20:31,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 30.19/12.85 [2019-03-28 12:20:31,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 30.19/12.85 [2019-03-28 12:20:31,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... 30.19/12.85 [2019-03-28 12:20:31,999 INFO L276 PluginConnector]: RCFGBuilder initialized 30.19/12.85 [2019-03-28 12:20:32,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (1/1) ... 30.19/12.85 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.85 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 30.19/12.85 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.19/12.85 [2019-03-28 12:20:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 30.19/12.85 [2019-03-28 12:20:32,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 30.19/12.85 [2019-03-28 12:20:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure f91 30.19/12.85 [2019-03-28 12:20:32,072 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 30.19/12.85 [2019-03-28 12:20:32,215 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 30.19/12.85 [2019-03-28 12:20:32,215 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 30.19/12.85 [2019-03-28 12:20:32,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:20:32 BoogieIcfgContainer 30.19/12.85 [2019-03-28 12:20:32,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 30.19/12.85 [2019-03-28 12:20:32,217 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 30.19/12.85 [2019-03-28 12:20:32,217 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 30.19/12.85 [2019-03-28 12:20:32,219 INFO L276 PluginConnector]: BlockEncodingV2 initialized 30.19/12.85 [2019-03-28 12:20:32,220 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:20:32" (1/1) ... 30.19/12.85 [2019-03-28 12:20:32,236 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 18 edges 30.19/12.85 [2019-03-28 12:20:32,238 INFO L258 BlockEncoder]: Using Remove infeasible edges 30.19/12.85 [2019-03-28 12:20:32,239 INFO L263 BlockEncoder]: Using Maximize final states 30.19/12.85 [2019-03-28 12:20:32,239 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 30.19/12.85 [2019-03-28 12:20:32,240 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 30.19/12.85 [2019-03-28 12:20:32,241 INFO L296 BlockEncoder]: Using Remove sink states 30.19/12.85 [2019-03-28 12:20:32,242 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 30.19/12.85 [2019-03-28 12:20:32,243 INFO L179 BlockEncoder]: Using Rewrite not-equals 30.19/12.85 [2019-03-28 12:20:32,257 INFO L185 BlockEncoder]: Using Use SBE 30.19/12.85 [2019-03-28 12:20:32,275 INFO L200 BlockEncoder]: SBE split 2 edges 30.19/12.85 [2019-03-28 12:20:32,280 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 30.19/12.85 [2019-03-28 12:20:32,282 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.19/12.85 [2019-03-28 12:20:32,290 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 30.19/12.85 [2019-03-28 12:20:32,292 INFO L70 RemoveSinkStates]: Removed 11 edges and 5 locations by removing sink states 30.19/12.85 [2019-03-28 12:20:32,294 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 30.19/12.85 [2019-03-28 12:20:32,294 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.19/12.85 [2019-03-28 12:20:32,294 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 30.19/12.85 [2019-03-28 12:20:32,294 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 30.19/12.85 [2019-03-28 12:20:32,295 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 11 edges 30.19/12.85 [2019-03-28 12:20:32,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:20:32 BasicIcfg 30.19/12.85 [2019-03-28 12:20:32,296 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 30.19/12.85 [2019-03-28 12:20:32,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 30.19/12.85 [2019-03-28 12:20:32,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... 30.19/12.85 [2019-03-28 12:20:32,300 INFO L276 PluginConnector]: TraceAbstraction initialized 30.19/12.85 [2019-03-28 12:20:32,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:20:31" (1/4) ... 30.19/12.85 [2019-03-28 12:20:32,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbf6572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:20:32, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:32,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (2/4) ... 30.19/12.85 [2019-03-28 12:20:32,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbf6572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:20:32, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:32,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:20:32" (3/4) ... 30.19/12.85 [2019-03-28 12:20:32,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbf6572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:20:32, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:32,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:20:32" (4/4) ... 30.19/12.85 [2019-03-28 12:20:32,304 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.19/12.85 [2019-03-28 12:20:32,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 30.19/12.85 [2019-03-28 12:20:32,321 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 30.19/12.85 [2019-03-28 12:20:32,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 30.19/12.85 [2019-03-28 12:20:32,367 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.19/12.85 [2019-03-28 12:20:32,368 INFO L382 AbstractCegarLoop]: Interprodecural is true 30.19/12.85 [2019-03-28 12:20:32,368 INFO L383 AbstractCegarLoop]: Hoare is true 30.19/12.85 [2019-03-28 12:20:32,368 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 30.19/12.85 [2019-03-28 12:20:32,368 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 30.19/12.85 [2019-03-28 12:20:32,369 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.19/12.85 [2019-03-28 12:20:32,369 INFO L387 AbstractCegarLoop]: Difference is false 30.19/12.85 [2019-03-28 12:20:32,369 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 30.19/12.85 [2019-03-28 12:20:32,369 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 30.19/12.85 [2019-03-28 12:20:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. 30.19/12.85 [2019-03-28 12:20:32,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 30.19/12.85 [2019-03-28 12:20:32,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. 30.19/12.85 [2019-03-28 12:20:32,455 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 30.19/12.85 [2019-03-28 12:20:32,456 INFO L451 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: true 30.19/12.85 [2019-03-28 12:20:32,456 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. 30.19/12.85 [2019-03-28 12:20:32,456 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. 30.19/12.85 [2019-03-28 12:20:32,456 INFO L451 ceAbstractionStarter]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true 30.19/12.85 [2019-03-28 12:20:32,457 INFO L448 ceAbstractionStarter]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. 30.19/12.85 [2019-03-28 12:20:32,457 INFO L451 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: true 30.19/12.85 [2019-03-28 12:20:32,457 INFO L448 ceAbstractionStarter]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. 30.19/12.85 [2019-03-28 12:20:32,457 INFO L451 ceAbstractionStarter]: At program point L19-1(line 19) the Hoare annotation is: true 30.19/12.85 [2019-03-28 12:20:32,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:20:32 BasicIcfg 30.19/12.85 [2019-03-28 12:20:32,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 30.19/12.85 [2019-03-28 12:20:32,461 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 30.19/12.85 [2019-03-28 12:20:32,461 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 30.19/12.85 [2019-03-28 12:20:32,465 INFO L276 PluginConnector]: BuchiAutomizer initialized 30.19/12.85 [2019-03-28 12:20:32,466 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.19/12.85 [2019-03-28 12:20:32,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:20:31" (1/5) ... 30.19/12.85 [2019-03-28 12:20:32,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47a1327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:20:32, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:32,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.19/12.85 [2019-03-28 12:20:32,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:20:31" (2/5) ... 30.19/12.85 [2019-03-28 12:20:32,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47a1327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:20:32, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:32,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.19/12.85 [2019-03-28 12:20:32,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:20:32" (3/5) ... 30.19/12.85 [2019-03-28 12:20:32,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47a1327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:20:32, skipping insertion in model container 30.19/12.85 [2019-03-28 12:20:32,468 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.19/12.85 [2019-03-28 12:20:32,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:20:32" (4/5) ... 30.19/12.85 [2019-03-28 12:20:32,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47a1327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:20:32, skipping insertion in model container 30.19/12.86 [2019-03-28 12:20:32,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.19/12.86 [2019-03-28 12:20:32,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:20:32" (5/5) ... 30.19/12.86 [2019-03-28 12:20:32,470 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.19/12.86 [2019-03-28 12:20:32,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.19/12.86 [2019-03-28 12:20:32,498 INFO L374 BuchiCegarLoop]: Interprodecural is true 30.19/12.86 [2019-03-28 12:20:32,498 INFO L375 BuchiCegarLoop]: Hoare is true 30.19/12.86 [2019-03-28 12:20:32,498 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 30.19/12.86 [2019-03-28 12:20:32,498 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 30.19/12.86 [2019-03-28 12:20:32,499 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.19/12.86 [2019-03-28 12:20:32,499 INFO L379 BuchiCegarLoop]: Difference is false 30.19/12.86 [2019-03-28 12:20:32,499 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 30.19/12.86 [2019-03-28 12:20:32,499 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 30.19/12.86 [2019-03-28 12:20:32,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 30.19/12.86 [2019-03-28 12:20:32,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 30.19/12.86 [2019-03-28 12:20:32,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.19/12.86 [2019-03-28 12:20:32,523 INFO L119 BuchiIsEmpty]: Starting construction of run 30.19/12.86 [2019-03-28 12:20:32,530 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 30.19/12.86 [2019-03-28 12:20:32,531 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.19/12.86 [2019-03-28 12:20:32,531 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 30.19/12.86 [2019-03-28 12:20:32,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 30.19/12.86 [2019-03-28 12:20:32,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 30.19/12.86 [2019-03-28 12:20:32,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.19/12.86 [2019-03-28 12:20:32,534 INFO L119 BuchiIsEmpty]: Starting construction of run 30.19/12.86 [2019-03-28 12:20:32,534 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 30.19/12.86 [2019-03-28 12:20:32,534 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.19/12.86 [2019-03-28 12:20:32,540 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 3#L26true [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 9#f91ENTRYtrue 30.19/12.86 [2019-03-28 12:20:32,540 INFO L796 eck$LassoCheckResult]: Loop: 9#f91ENTRYtrue [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 10#L16true [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 7#L19true [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 9#f91ENTRYtrue 30.19/12.86 [2019-03-28 12:20:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2199, now seen corresponding path program 1 times 30.19/12.86 [2019-03-28 12:20:32,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.19/12.86 [2019-03-28 12:20:32,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.19/12.86 [2019-03-28 12:20:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 71644, now seen corresponding path program 1 times 30.19/12.86 [2019-03-28 12:20:32,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.19/12.86 [2019-03-28 12:20:32,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.19/12.86 [2019-03-28 12:20:32,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:32,630 INFO L82 PathProgramCache]: Analyzing trace with hash 65552262, now seen corresponding path program 1 times 30.19/12.86 [2019-03-28 12:20:32,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.19/12.86 [2019-03-28 12:20:32,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.19/12.86 [2019-03-28 12:20:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:32,706 INFO L216 LassoAnalysis]: Preferences: 30.19/12.86 [2019-03-28 12:20:32,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.19/12.86 [2019-03-28 12:20:32,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.19/12.86 [2019-03-28 12:20:32,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.19/12.86 [2019-03-28 12:20:32,708 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.19/12.86 [2019-03-28 12:20:32,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:32,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.19/12.86 [2019-03-28 12:20:32,708 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.19/12.86 [2019-03-28 12:20:32,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.19/12.86 [2019-03-28 12:20:32,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.19/12.86 [2019-03-28 12:20:32,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.19/12.86 [2019-03-28 12:20:32,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,834 INFO L300 LassoAnalysis]: Preprocessing complete. 30.19/12.86 [2019-03-28 12:20:32,835 INFO L412 LassoAnalysis]: Checking for nontermination... 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:32,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:32,843 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 [2019-03-28 12:20:32,852 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.19/12.86 [2019-03-28 12:20:32,852 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:32,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:32,882 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 [2019-03-28 12:20:32,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.19/12.86 [2019-03-28 12:20:32,886 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:32,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:32,912 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:32,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:32,944 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 [2019-03-28 12:20:32,975 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.19/12.86 [2019-03-28 12:20:32,977 INFO L216 LassoAnalysis]: Preferences: 30.19/12.86 [2019-03-28 12:20:32,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.19/12.86 [2019-03-28 12:20:32,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.19/12.86 [2019-03-28 12:20:32,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.19/12.86 [2019-03-28 12:20:32,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.19/12.86 [2019-03-28 12:20:32,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:32,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.19/12.86 [2019-03-28 12:20:32,978 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.19/12.86 [2019-03-28 12:20:32,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 30.19/12.86 [2019-03-28 12:20:32,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.19/12.86 [2019-03-28 12:20:32,979 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.19/12.86 [2019-03-28 12:20:32,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:32,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,053 INFO L300 LassoAnalysis]: Preprocessing complete. 30.19/12.86 [2019-03-28 12:20:33,059 INFO L497 LassoAnalysis]: Using template 'affine'. 30.19/12.86 [2019-03-28 12:20:33,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.19/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.19/12.86 Number of strict supporting invariants: 0 30.19/12.86 Number of non-strict supporting invariants: 1 30.19/12.86 Consider only non-deceasing supporting invariants: true 30.19/12.86 Simplify termination arguments: true 30.19/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.19/12.86 [2019-03-28 12:20:33,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.19/12.86 [2019-03-28 12:20:33,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.19/12.86 [2019-03-28 12:20:33,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.19/12.86 [2019-03-28 12:20:33,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.19/12.86 [2019-03-28 12:20:33,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.19/12.86 [2019-03-28 12:20:33,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.19/12.86 [2019-03-28 12:20:33,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.19/12.86 [2019-03-28 12:20:33,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.19/12.86 [2019-03-28 12:20:33,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.19/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.19/12.86 Number of strict supporting invariants: 0 30.19/12.86 Number of non-strict supporting invariants: 1 30.19/12.86 Consider only non-deceasing supporting invariants: true 30.19/12.86 Simplify termination arguments: true 30.19/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.19/12.86 [2019-03-28 12:20:33,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.19/12.86 [2019-03-28 12:20:33,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.19/12.86 [2019-03-28 12:20:33,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.19/12.86 [2019-03-28 12:20:33,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.19/12.86 [2019-03-28 12:20:33,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.19/12.86 [2019-03-28 12:20:33,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.19/12.86 [2019-03-28 12:20:33,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.19/12.86 [2019-03-28 12:20:33,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.19/12.86 [2019-03-28 12:20:33,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.19/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.19/12.86 Number of strict supporting invariants: 0 30.19/12.86 Number of non-strict supporting invariants: 1 30.19/12.86 Consider only non-deceasing supporting invariants: true 30.19/12.86 Simplify termination arguments: true 30.19/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.19/12.86 [2019-03-28 12:20:33,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.19/12.86 [2019-03-28 12:20:33,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.19/12.86 [2019-03-28 12:20:33,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.19/12.86 [2019-03-28 12:20:33,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.19/12.86 [2019-03-28 12:20:33,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.19/12.86 [2019-03-28 12:20:33,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.19/12.86 [2019-03-28 12:20:33,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.19/12.86 [2019-03-28 12:20:33,085 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.19/12.86 [2019-03-28 12:20:33,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.19/12.86 [2019-03-28 12:20:33,091 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 30.19/12.86 [2019-03-28 12:20:33,093 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.19/12.86 [2019-03-28 12:20:33,094 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.19/12.86 [2019-03-28 12:20:33,094 INFO L518 LassoAnalysis]: Proved termination. 30.19/12.86 [2019-03-28 12:20:33,094 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.19/12.86 Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 30.19/12.86 Supporting invariants [] 30.19/12.86 [2019-03-28 12:20:33,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.19/12.86 [2019-03-28 12:20:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.19/12.86 [2019-03-28 12:20:33,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core 30.19/12.86 [2019-03-28 12:20:33,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.19/12.86 [2019-03-28 12:20:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.19/12.86 [2019-03-28 12:20:33,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 30.19/12.86 [2019-03-28 12:20:33,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.19/12.86 [2019-03-28 12:20:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.19/12.86 [2019-03-28 12:20:33,260 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 30.19/12.86 [2019-03-28 12:20:33,266 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 3 loop predicates 30.19/12.86 [2019-03-28 12:20:33,267 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. 30.19/12.86 [2019-03-28 12:20:33,375 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 31 states and 39 transitions. Complement of second has 16 states. 30.19/12.86 [2019-03-28 12:20:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 30.19/12.86 [2019-03-28 12:20:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.19/12.86 [2019-03-28 12:20:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. 30.19/12.86 [2019-03-28 12:20:33,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 3 letters. 30.19/12.86 [2019-03-28 12:20:33,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.19/12.86 [2019-03-28 12:20:33,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. 30.19/12.86 [2019-03-28 12:20:33,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.19/12.86 [2019-03-28 12:20:33,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. 30.19/12.86 [2019-03-28 12:20:33,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.19/12.86 [2019-03-28 12:20:33,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. 30.19/12.86 [2019-03-28 12:20:33,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 30.19/12.86 [2019-03-28 12:20:33,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 27 transitions. 30.19/12.86 [2019-03-28 12:20:33,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 30.19/12.86 [2019-03-28 12:20:33,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 30.19/12.86 [2019-03-28 12:20:33,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. 30.19/12.86 [2019-03-28 12:20:33,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.19/12.86 [2019-03-28 12:20:33,404 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 30.19/12.86 [2019-03-28 12:20:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. 30.19/12.86 [2019-03-28 12:20:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 30.19/12.86 [2019-03-28 12:20:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 30.19/12.86 [2019-03-28 12:20:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. 30.19/12.86 [2019-03-28 12:20:33,440 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 30.19/12.86 [2019-03-28 12:20:33,440 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. 30.19/12.86 [2019-03-28 12:20:33,440 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 30.19/12.86 [2019-03-28 12:20:33,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. 30.19/12.86 [2019-03-28 12:20:33,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 30.19/12.86 [2019-03-28 12:20:33,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.19/12.86 [2019-03-28 12:20:33,442 INFO L119 BuchiIsEmpty]: Starting construction of run 30.19/12.86 [2019-03-28 12:20:33,443 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 30.19/12.86 [2019-03-28 12:20:33,443 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 30.19/12.86 [2019-03-28 12:20:33,444 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 96#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 97#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 109#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 102#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 107#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 111#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 112#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 113#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 99#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 106#f91ENTRY 30.19/12.86 [2019-03-28 12:20:33,444 INFO L796 eck$LassoCheckResult]: Loop: 106#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 114#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 100#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 106#f91ENTRY 30.19/12.86 [2019-03-28 12:20:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1787708875, now seen corresponding path program 1 times 30.19/12.86 [2019-03-28 12:20:33,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.19/12.86 [2019-03-28 12:20:33,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.19/12.86 [2019-03-28 12:20:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 71644, now seen corresponding path program 2 times 30.19/12.86 [2019-03-28 12:20:33,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.19/12.86 [2019-03-28 12:20:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.19/12.86 [2019-03-28 12:20:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.19/12.86 [2019-03-28 12:20:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash -40582872, now seen corresponding path program 2 times 30.19/12.86 [2019-03-28 12:20:33,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.19/12.86 [2019-03-28 12:20:33,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.19/12.86 [2019-03-28 12:20:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.19/12.86 [2019-03-28 12:20:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.19/12.86 [2019-03-28 12:20:33,509 INFO L216 LassoAnalysis]: Preferences: 30.19/12.86 [2019-03-28 12:20:33,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.19/12.86 [2019-03-28 12:20:33,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.19/12.86 [2019-03-28 12:20:33,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.19/12.86 [2019-03-28 12:20:33,510 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.19/12.86 [2019-03-28 12:20:33,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:33,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.19/12.86 [2019-03-28 12:20:33,510 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.19/12.86 [2019-03-28 12:20:33,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 30.19/12.86 [2019-03-28 12:20:33,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.19/12.86 [2019-03-28 12:20:33,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.19/12.86 [2019-03-28 12:20:33,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.19/12.86 [2019-03-28 12:20:33,552 INFO L300 LassoAnalysis]: Preprocessing complete. 30.19/12.86 [2019-03-28 12:20:33,553 INFO L412 LassoAnalysis]: Checking for nontermination... 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:33,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:33,560 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 [2019-03-28 12:20:33,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.19/12.86 [2019-03-28 12:20:33,564 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:33,594 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:33,594 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 [2019-03-28 12:20:33,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.19/12.86 [2019-03-28 12:20:33,598 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:33,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.19/12.86 [2019-03-28 12:20:33,627 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.19/12.86 [2019-03-28 12:20:33,631 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.19/12.86 [2019-03-28 12:20:33,631 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.19/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.19/12.86 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.19/12.86 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.19/12.86 [2019-03-28 12:20:33,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:33,659 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:33,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.24/12.86 [2019-03-28 12:20:33,664 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:33,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:33,692 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:33,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:33,741 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:33,773 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.24/12.86 [2019-03-28 12:20:33,775 INFO L216 LassoAnalysis]: Preferences: 30.24/12.86 [2019-03-28 12:20:33,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.24/12.86 [2019-03-28 12:20:33,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.24/12.86 [2019-03-28 12:20:33,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.24/12.86 [2019-03-28 12:20:33,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.24/12.86 [2019-03-28 12:20:33,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:33,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.24/12.86 [2019-03-28 12:20:33,777 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.24/12.86 [2019-03-28 12:20:33,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 30.24/12.86 [2019-03-28 12:20:33,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.24/12.86 [2019-03-28 12:20:33,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.24/12.86 [2019-03-28 12:20:33,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:33,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:33,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:33,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:33,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:33,832 INFO L300 LassoAnalysis]: Preprocessing complete. 30.24/12.86 [2019-03-28 12:20:33,832 INFO L497 LassoAnalysis]: Using template 'affine'. 30.24/12.86 [2019-03-28 12:20:33,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:33,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:33,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:33,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:33,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:33,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:33,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:33,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:33,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.24/12.86 [2019-03-28 12:20:33,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:33,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:33,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:33,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:33,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:33,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:33,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:33,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:33,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.24/12.86 [2019-03-28 12:20:33,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:33,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:33,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:33,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:33,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:33,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:33,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:33,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:33,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.24/12.86 [2019-03-28 12:20:33,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:33,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:33,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:33,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:33,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:33,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:33,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:33,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:33,853 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.24/12.86 [2019-03-28 12:20:33,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.24/12.86 [2019-03-28 12:20:33,857 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 30.24/12.86 [2019-03-28 12:20:33,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.24/12.86 [2019-03-28 12:20:33,857 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.24/12.86 [2019-03-28 12:20:33,858 INFO L518 LassoAnalysis]: Proved termination. 30.24/12.86 [2019-03-28 12:20:33,858 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.24/12.86 Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 30.24/12.86 Supporting invariants [] 30.24/12.86 [2019-03-28 12:20:33,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.24/12.86 [2019-03-28 12:20:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:33,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:33,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:33,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:33,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:34,018 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 30.24/12.86 [2019-03-28 12:20:34,019 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates 30.24/12.86 [2019-03-28 12:20:34,019 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. 30.24/12.86 [2019-03-28 12:20:34,183 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 17 states. 30.24/12.86 [2019-03-28 12:20:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states 30.24/12.86 [2019-03-28 12:20:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 30.24/12.86 [2019-03-28 12:20:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. 30.24/12.86 [2019-03-28 12:20:34,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. 30.24/12.86 [2019-03-28 12:20:34,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:34,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. 30.24/12.86 [2019-03-28 12:20:34,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:34,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. 30.24/12.86 [2019-03-28 12:20:34,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:34,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. 30.24/12.86 [2019-03-28 12:20:34,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 30.24/12.86 [2019-03-28 12:20:34,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 44 transitions. 30.24/12.86 [2019-03-28 12:20:34,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 30.24/12.86 [2019-03-28 12:20:34,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 30.24/12.86 [2019-03-28 12:20:34,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. 30.24/12.86 [2019-03-28 12:20:34,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.24/12.86 [2019-03-28 12:20:34,196 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. 30.24/12.86 [2019-03-28 12:20:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. 30.24/12.86 [2019-03-28 12:20:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. 30.24/12.86 [2019-03-28 12:20:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 30.24/12.86 [2019-03-28 12:20:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. 30.24/12.86 [2019-03-28 12:20:34,201 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. 30.24/12.86 [2019-03-28 12:20:34,202 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. 30.24/12.86 [2019-03-28 12:20:34,202 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 30.24/12.86 [2019-03-28 12:20:34,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. 30.24/12.86 [2019-03-28 12:20:34,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 30.24/12.86 [2019-03-28 12:20:34,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.24/12.86 [2019-03-28 12:20:34,203 INFO L119 BuchiIsEmpty]: Starting construction of run 30.24/12.86 [2019-03-28 12:20:34,204 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 30.24/12.86 [2019-03-28 12:20:34,204 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 30.24/12.86 [2019-03-28 12:20:34,204 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 248#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 249#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 255#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 243#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 252#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 257#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 253#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 254#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 246#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 251#f91ENTRY 30.24/12.86 [2019-03-28 12:20:34,205 INFO L796 eck$LassoCheckResult]: Loop: 251#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 258#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 245#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 265#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 266#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 264#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 259#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 242#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 251#f91ENTRY 30.24/12.86 [2019-03-28 12:20:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1787708875, now seen corresponding path program 3 times 30.24/12.86 [2019-03-28 12:20:34,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:34,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:34,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1847548001, now seen corresponding path program 1 times 30.24/12.86 [2019-03-28 12:20:34,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -52498989, now seen corresponding path program 4 times 30.24/12.86 [2019-03-28 12:20:34,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,324 INFO L216 LassoAnalysis]: Preferences: 30.24/12.86 [2019-03-28 12:20:34,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.24/12.86 [2019-03-28 12:20:34,325 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.24/12.86 [2019-03-28 12:20:34,325 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.24/12.86 [2019-03-28 12:20:34,325 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.24/12.86 [2019-03-28 12:20:34,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.24/12.86 [2019-03-28 12:20:34,325 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.24/12.86 [2019-03-28 12:20:34,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 30.24/12.86 [2019-03-28 12:20:34,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.24/12.86 [2019-03-28 12:20:34,326 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.24/12.86 [2019-03-28 12:20:34,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,370 INFO L300 LassoAnalysis]: Preprocessing complete. 30.24/12.86 [2019-03-28 12:20:34,370 INFO L412 LassoAnalysis]: Checking for nontermination... 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:34,374 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:34,378 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.24/12.86 [2019-03-28 12:20:34,378 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:34,405 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:34,409 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.24/12.86 [2019-03-28 12:20:34,409 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:34,436 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:34,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. 30.24/12.86 [2019-03-28 12:20:34,439 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:34,481 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:34,516 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:34,521 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.24/12.86 [2019-03-28 12:20:34,545 INFO L216 LassoAnalysis]: Preferences: 30.24/12.86 [2019-03-28 12:20:34,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.24/12.86 [2019-03-28 12:20:34,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.24/12.86 [2019-03-28 12:20:34,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.24/12.86 [2019-03-28 12:20:34,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.24/12.86 [2019-03-28 12:20:34,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:34,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.24/12.86 [2019-03-28 12:20:34,546 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.24/12.86 [2019-03-28 12:20:34,546 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 30.24/12.86 [2019-03-28 12:20:34,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.24/12.86 [2019-03-28 12:20:34,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.24/12.86 [2019-03-28 12:20:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:34,585 INFO L300 LassoAnalysis]: Preprocessing complete. 30.24/12.86 [2019-03-28 12:20:34,585 INFO L497 LassoAnalysis]: Using template 'affine'. 30.24/12.86 [2019-03-28 12:20:34,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:34,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:34,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:34,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:34,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:34,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:34,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:34,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:34,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.24/12.86 [2019-03-28 12:20:34,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:34,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:34,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:34,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:34,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:34,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:34,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:34,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:34,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.24/12.86 [2019-03-28 12:20:34,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:34,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:34,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:34,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:34,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:34,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:34,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:34,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:34,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.24/12.86 [2019-03-28 12:20:34,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:34,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:34,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:34,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:34,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:34,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:34,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:34,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:34,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.24/12.86 [2019-03-28 12:20:34,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.24/12.86 [2019-03-28 12:20:34,604 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 30.24/12.86 [2019-03-28 12:20:34,605 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.24/12.86 [2019-03-28 12:20:34,605 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.24/12.86 [2019-03-28 12:20:34,605 INFO L518 LassoAnalysis]: Proved termination. 30.24/12.86 [2019-03-28 12:20:34,605 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.24/12.86 Ranking function f(f91_#in~x) = -2*f91_#in~x + 201 30.24/12.86 Supporting invariants [] 30.24/12.86 [2019-03-28 12:20:34,605 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.24/12.86 [2019-03-28 12:20:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:34,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:34,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:34,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:34,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,873 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.24/12.86 [2019-03-28 12:20:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:34,886 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.24/12.86 [2019-03-28 12:20:34,886 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 30.24/12.86 [2019-03-28 12:20:34,887 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 7 loop predicates 30.24/12.86 [2019-03-28 12:20:34,887 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 9 states. 30.24/12.86 [2019-03-28 12:20:35,288 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 9 states. Result 377 states and 496 transitions. Complement of second has 174 states. 30.24/12.86 [2019-03-28 12:20:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states 30.24/12.86 [2019-03-28 12:20:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 30.24/12.86 [2019-03-28 12:20:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. 30.24/12.86 [2019-03-28 12:20:35,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 10 letters. Loop has 8 letters. 30.24/12.86 [2019-03-28 12:20:35,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:35,291 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 30.24/12.86 [2019-03-28 12:20:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:35,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:35,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:35,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:35,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:35,459 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates 30.24/12.86 [2019-03-28 12:20:35,460 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 9 states. 30.24/12.86 [2019-03-28 12:20:35,827 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 9 states. Result 255 states and 321 transitions. Complement of second has 144 states. 30.24/12.86 [2019-03-28 12:20:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states 30.24/12.86 [2019-03-28 12:20:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 30.24/12.86 [2019-03-28 12:20:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. 30.24/12.86 [2019-03-28 12:20:35,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 10 letters. Loop has 8 letters. 30.24/12.86 [2019-03-28 12:20:35,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:35,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 18 letters. Loop has 8 letters. 30.24/12.86 [2019-03-28 12:20:35,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:35,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 26 transitions. Stem has 10 letters. Loop has 16 letters. 30.24/12.86 [2019-03-28 12:20:35,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:35,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 321 transitions. 30.24/12.86 [2019-03-28 12:20:35,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 30.24/12.86 [2019-03-28 12:20:35,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 79 states and 120 transitions. 30.24/12.86 [2019-03-28 12:20:35,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 30.24/12.86 [2019-03-28 12:20:35,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 30.24/12.86 [2019-03-28 12:20:35,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 120 transitions. 30.24/12.86 [2019-03-28 12:20:35,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.24/12.86 [2019-03-28 12:20:35,848 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 120 transitions. 30.24/12.86 [2019-03-28 12:20:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 120 transitions. 30.24/12.86 [2019-03-28 12:20:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 31. 30.24/12.86 [2019-03-28 12:20:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 30.24/12.86 [2019-03-28 12:20:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. 30.24/12.86 [2019-03-28 12:20:35,858 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. 30.24/12.86 [2019-03-28 12:20:35,858 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. 30.24/12.86 [2019-03-28 12:20:35,858 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 30.24/12.86 [2019-03-28 12:20:35,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. 30.24/12.86 [2019-03-28 12:20:35,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 30.24/12.86 [2019-03-28 12:20:35,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.24/12.86 [2019-03-28 12:20:35,859 INFO L119 BuchiIsEmpty]: Starting construction of run 30.24/12.86 [2019-03-28 12:20:35,860 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 30.24/12.86 [2019-03-28 12:20:35,860 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] 30.24/12.86 [2019-03-28 12:20:35,861 INFO L794 eck$LassoCheckResult]: Stem: 1402#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 1392#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 1393#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1418#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 1397#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 1417#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1420#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 1421#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1413#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 1399#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 1403#f91ENTRY 30.24/12.86 [2019-03-28 12:20:35,861 INFO L796 eck$LassoCheckResult]: Loop: 1403#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1410#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 1396#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 1405#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1410#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 1396#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 1405#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1412#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 1408#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1409#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 1395#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 1404#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 1414#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 1406#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1407#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 1394#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 1401#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1416#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 1400#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 1403#f91ENTRY 30.24/12.86 [2019-03-28 12:20:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1787708875, now seen corresponding path program 5 times 30.24/12.86 [2019-03-28 12:20:35,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:35,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2105170838, now seen corresponding path program 1 times 30.24/12.86 [2019-03-28 12:20:35,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash 185199842, now seen corresponding path program 1 times 30.24/12.86 [2019-03-28 12:20:35,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:35,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:35,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.24/12.86 [2019-03-28 12:20:35,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.24/12.86 [2019-03-28 12:20:35,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:35,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:35,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:36,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.24/12.86 [2019-03-28 12:20:36,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 30.24/12.86 [2019-03-28 12:20:36,208 INFO L216 LassoAnalysis]: Preferences: 30.24/12.86 [2019-03-28 12:20:36,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.24/12.86 [2019-03-28 12:20:36,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.24/12.86 [2019-03-28 12:20:36,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.24/12.86 [2019-03-28 12:20:36,208 INFO L127 ssoRankerPreferences]: Use exernal solver: true 30.24/12.86 [2019-03-28 12:20:36,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:36,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.24/12.86 [2019-03-28 12:20:36,209 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.24/12.86 [2019-03-28 12:20:36,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 30.24/12.86 [2019-03-28 12:20:36,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.24/12.86 [2019-03-28 12:20:36,209 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.24/12.86 [2019-03-28 12:20:36,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,247 INFO L300 LassoAnalysis]: Preprocessing complete. 30.24/12.86 [2019-03-28 12:20:36,247 INFO L412 LassoAnalysis]: Checking for nontermination... 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:36,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:36,251 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.24/12.86 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 30.24/12.86 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:36,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 30.24/12.86 [2019-03-28 12:20:36,281 INFO L163 nArgumentSynthesizer]: Using integer mode. 30.24/12.86 [2019-03-28 12:20:36,287 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 30.24/12.86 [2019-03-28 12:20:36,316 INFO L216 LassoAnalysis]: Preferences: 30.24/12.86 [2019-03-28 12:20:36,316 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.24/12.86 [2019-03-28 12:20:36,316 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.24/12.86 [2019-03-28 12:20:36,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.24/12.86 [2019-03-28 12:20:36,316 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.24/12.86 [2019-03-28 12:20:36,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.24/12.86 [2019-03-28 12:20:36,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.24/12.86 [2019-03-28 12:20:36,317 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.24/12.86 [2019-03-28 12:20:36,317 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 30.24/12.86 [2019-03-28 12:20:36,317 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.24/12.86 [2019-03-28 12:20:36,317 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.24/12.86 [2019-03-28 12:20:36,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.24/12.86 [2019-03-28 12:20:36,354 INFO L300 LassoAnalysis]: Preprocessing complete. 30.24/12.86 [2019-03-28 12:20:36,354 INFO L497 LassoAnalysis]: Using template 'affine'. 30.24/12.86 [2019-03-28 12:20:36,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.24/12.86 Termination analysis: LINEAR_WITH_GUESSES 30.24/12.86 Number of strict supporting invariants: 0 30.24/12.86 Number of non-strict supporting invariants: 1 30.24/12.86 Consider only non-deceasing supporting invariants: true 30.24/12.86 Simplify termination arguments: true 30.24/12.86 Simplify supporting invariants: trueOverapproximate stem: false 30.24/12.86 [2019-03-28 12:20:36,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.24/12.86 [2019-03-28 12:20:36,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.24/12.86 [2019-03-28 12:20:36,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.24/12.86 [2019-03-28 12:20:36,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.24/12.86 [2019-03-28 12:20:36,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.24/12.86 [2019-03-28 12:20:36,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.24/12.86 [2019-03-28 12:20:36,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.24/12.86 [2019-03-28 12:20:36,361 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.24/12.86 [2019-03-28 12:20:36,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 30.24/12.86 [2019-03-28 12:20:36,363 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 30.24/12.86 [2019-03-28 12:20:36,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.24/12.86 [2019-03-28 12:20:36,364 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 30.24/12.86 [2019-03-28 12:20:36,364 INFO L518 LassoAnalysis]: Proved termination. 30.24/12.86 [2019-03-28 12:20:36,364 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.24/12.86 Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 30.24/12.86 Supporting invariants [] 30.24/12.86 [2019-03-28 12:20:36,365 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 30.24/12.86 [2019-03-28 12:20:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:36,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:36,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:36,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core 30.24/12.86 [2019-03-28 12:20:36,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.24/12.86 [2019-03-28 12:20:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:36,803 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.24/12.86 [2019-03-28 12:20:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.24/12.86 [2019-03-28 12:20:36,826 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 30.24/12.86 [2019-03-28 12:20:36,826 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization 30.24/12.86 [2019-03-28 12:20:36,826 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 12 loop predicates 30.24/12.86 [2019-03-28 12:20:36,826 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 11 Second operand 12 states. 30.24/12.86 [2019-03-28 12:20:38,867 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 11. Second operand 12 states. Result 6173 states and 9271 transitions. Complement of second has 4264 states. 30.24/12.86 [2019-03-28 12:20:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 2 stem states 25 non-accepting loop states 1 accepting loop states 30.24/12.86 [2019-03-28 12:20:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 30.24/12.86 [2019-03-28 12:20:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. 30.24/12.86 [2019-03-28 12:20:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 19 letters. 30.24/12.86 [2019-03-28 12:20:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:38,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 29 letters. Loop has 19 letters. 30.24/12.86 [2019-03-28 12:20:38,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:38,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 65 transitions. Stem has 10 letters. Loop has 38 letters. 30.24/12.86 [2019-03-28 12:20:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.24/12.86 [2019-03-28 12:20:38,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6173 states and 9271 transitions. 30.24/12.86 [2019-03-28 12:20:39,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 30.24/12.86 [2019-03-28 12:20:39,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6173 states to 778 states and 1216 transitions. 30.24/12.86 [2019-03-28 12:20:39,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269 30.24/12.86 [2019-03-28 12:20:39,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 30.24/12.86 [2019-03-28 12:20:39,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 778 states and 1216 transitions. 30.24/12.86 [2019-03-28 12:20:39,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.24/12.86 [2019-03-28 12:20:39,059 INFO L706 BuchiCegarLoop]: Abstraction has 778 states and 1216 transitions. 30.24/12.86 [2019-03-28 12:20:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states and 1216 transitions. 30.24/12.86 [2019-03-28 12:20:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 669. 30.24/12.86 [2019-03-28 12:20:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. 30.24/12.86 [2019-03-28 12:20:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 951 transitions. 30.24/12.86 [2019-03-28 12:20:39,196 INFO L729 BuchiCegarLoop]: Abstraction has 669 states and 951 transitions. 30.24/12.86 [2019-03-28 12:20:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 30.24/12.86 [2019-03-28 12:20:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 30.24/12.86 [2019-03-28 12:20:39,201 INFO L87 Difference]: Start difference. First operand 669 states and 951 transitions. Second operand 8 states. 30.24/12.86 [2019-03-28 12:20:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.24/12.86 [2019-03-28 12:20:39,423 INFO L93 Difference]: Finished difference Result 664 states and 892 transitions. 30.24/12.86 [2019-03-28 12:20:39,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 30.24/12.86 [2019-03-28 12:20:39,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 892 transitions. 30.24/12.86 [2019-03-28 12:20:39,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 30.24/12.86 [2019-03-28 12:20:39,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 513 states and 695 transitions. 30.24/12.86 [2019-03-28 12:20:39,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 30.24/12.86 [2019-03-28 12:20:39,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 30.24/12.86 [2019-03-28 12:20:39,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 695 transitions. 30.24/12.86 [2019-03-28 12:20:39,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.24/12.86 [2019-03-28 12:20:39,445 INFO L706 BuchiCegarLoop]: Abstraction has 513 states and 695 transitions. 30.24/12.86 [2019-03-28 12:20:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 695 transitions. 30.24/12.86 [2019-03-28 12:20:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 445. 30.24/12.86 [2019-03-28 12:20:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. 30.24/12.86 [2019-03-28 12:20:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 579 transitions. 30.24/12.86 [2019-03-28 12:20:39,467 INFO L729 BuchiCegarLoop]: Abstraction has 445 states and 579 transitions. 30.24/12.86 [2019-03-28 12:20:39,467 INFO L609 BuchiCegarLoop]: Abstraction has 445 states and 579 transitions. 30.24/12.86 [2019-03-28 12:20:39,468 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 30.24/12.86 [2019-03-28 12:20:39,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 445 states and 579 transitions. 30.24/12.86 [2019-03-28 12:20:39,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 30.24/12.86 [2019-03-28 12:20:39,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.24/12.86 [2019-03-28 12:20:39,472 INFO L119 BuchiIsEmpty]: Starting construction of run 30.24/12.86 [2019-03-28 12:20:39,474 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [13, 8, 8, 7, 5, 5, 5, 3, 3, 1, 1] 30.24/12.86 [2019-03-28 12:20:39,474 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 5, 4, 4, 3, 3, 3, 2, 2] 30.24/12.86 [2019-03-28 12:20:39,476 INFO L794 eck$LassoCheckResult]: Stem: 13480#ULTIMATE.startENTRY [39] ULTIMATE.startENTRY-->L26: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|) InVars {} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 13478#L26 [29] L26-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_1| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{f91_#in~x=|v_f91_#in~xInParam_1|} AuxVars[] AssignedVars[f91_#in~x]< 13479#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13496#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13519#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13520#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13521#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13522#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13520#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13521#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13522#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13520#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13523#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13574#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13573#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13512#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13511#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13513#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13628#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13625#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13624#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13623#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13619#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13620#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13627#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13655#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13693#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13694#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13716#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13712#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13713#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13718#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13711#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13713#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13717#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13715#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13710#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13706#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13709#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13735#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13730#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13705#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13708#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13725#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13723#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13720#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13722#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13849#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13848#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13719#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13688#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13714#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13695#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13677#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13691#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13782#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13539#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13815#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13825#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13548#L19 30.24/12.86 [2019-03-28 12:20:39,476 INFO L796 eck$LassoCheckResult]: Loop: 13548#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13547#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13550#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13549#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13547#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13550#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13549#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13547#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13551#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13593#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13591#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13592#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13590#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13861#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13835#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13828#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13827#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13824#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13822#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13819#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13821#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13892#L16 [37] L16-->f91FINAL: Formula: (and (< 100 v_f91_~x_1) (= |v_f91_#res_1| (+ v_f91_~x_1 (- 10)))) InVars {f91_~x=v_f91_~x_1} OutVars{f91_#res=|v_f91_#res_1|, f91_~x=v_f91_~x_1} AuxVars[] AssignedVars[f91_#res] 13852#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13818#f91EXIT >[44] f91EXIT-->L19-2: AOR: Formula: (= |v_f91_#t~ret1_4| |v_f91_#resOutParam_3|) InVars {f91_#res=|v_f91_#resOutParam_3|} OutVars{f91_#t~ret1=|v_f91_#t~ret1_4|} AuxVars[] AssignedVars[f91_#t~ret1] LVA: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x] 13799#L19-2 [30] L19-2-->f91FINAL: Formula: (= |v_f91_#res_2| |v_f91_#t~ret1_3|) InVars {f91_#t~ret1=|v_f91_#t~ret1_3|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_3|, f91_#t~ret1=|v_f91_#t~ret1_2|, f91_#res=|v_f91_#res_2|} AuxVars[] AssignedVars[f91_#t~ret0, f91_#t~ret1, f91_#res] 13826#f91FINAL [35] f91FINAL-->f91EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 13823#f91EXIT >[46] f91EXIT-->L19-1: AOR: Formula: (= |v_f91_#t~ret0_4| |v_f91_#resOutParam_2|) InVars {f91_#res=|v_f91_#resOutParam_2|} OutVars{f91_#t~ret0=|v_f91_#t~ret0_4|} AuxVars[] AssignedVars[f91_#t~ret0] LVA: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x] 13560#L19-1 [33] L19-1-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_3| |v_f91_#t~ret0_5|) InVars {f91_#t~ret0=|v_f91_#t~ret0_5|} OutVars{f91_#in~x=|v_f91_#in~xInParam_3|} AuxVars[] AssignedVars[f91_#in~x]< 13482#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13568#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13538#L19 [34] L19-->f91ENTRY: Formula: (= |v_f91_#in~xInParam_2| (+ v_f91_~x_5 11)) InVars {f91_~x=v_f91_~x_5} OutVars{f91_#in~x=|v_f91_#in~xInParam_2|} AuxVars[] AssignedVars[f91_#in~x]< 13815#f91ENTRY [42] f91ENTRY-->L16: Formula: (= v_f91_~x_4 |v_f91_#in~x_1|) InVars {f91_#in~x=|v_f91_#in~x_1|} OutVars{f91_#in~x=|v_f91_#in~x_1|, f91_~x=v_f91_~x_4} AuxVars[] AssignedVars[f91_~x] 13825#L16 [47] L16-->L19: Formula: (>= 100 v_f91_~x_2) InVars {f91_~x=v_f91_~x_2} OutVars{f91_~x=v_f91_~x_2} AuxVars[] AssignedVars[] 13548#L19 30.24/12.86 [2019-03-28 12:20:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 882491387, now seen corresponding path program 2 times 30.24/12.86 [2019-03-28 12:20:39,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:39,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:39,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.24/12.86 [2019-03-28 12:20:39,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 30.24/12.86 [2019-03-28 12:20:39,566 INFO L799 eck$LassoCheckResult]: stem already infeasible 30.24/12.86 [2019-03-28 12:20:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.24/12.86 [2019-03-28 12:20:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1128724048, now seen corresponding path program 2 times 30.24/12.86 [2019-03-28 12:20:39,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.24/12.86 [2019-03-28 12:20:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.24/12.86 [2019-03-28 12:20:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:39,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.24/12.86 [2019-03-28 12:20:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.24/12.86 [2019-03-28 12:20:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. 30.24/12.86 [2019-03-28 12:20:39,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.24/12.86 [2019-03-28 12:20:39,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 30.24/12.86 [2019-03-28 12:20:39,634 INFO L811 eck$LassoCheckResult]: loop already infeasible 30.24/12.86 [2019-03-28 12:20:39,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 30.24/12.86 [2019-03-28 12:20:39,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 30.24/12.86 [2019-03-28 12:20:39,635 INFO L87 Difference]: Start difference. First operand 445 states and 579 transitions. cyclomatic complexity: 144 Second operand 9 states. 30.24/12.86 [2019-03-28 12:20:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.24/12.86 [2019-03-28 12:20:39,798 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. 30.24/12.86 [2019-03-28 12:20:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 30.24/12.86 [2019-03-28 12:20:39,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. 30.24/12.86 [2019-03-28 12:20:39,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.24/12.86 [2019-03-28 12:20:39,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. 30.24/12.86 [2019-03-28 12:20:39,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 30.24/12.86 [2019-03-28 12:20:39,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 30.24/12.86 [2019-03-28 12:20:39,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 30.24/12.86 [2019-03-28 12:20:39,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.24/12.86 [2019-03-28 12:20:39,803 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.24/12.86 [2019-03-28 12:20:39,803 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.24/12.86 [2019-03-28 12:20:39,803 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.24/12.86 [2019-03-28 12:20:39,803 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 30.24/12.86 [2019-03-28 12:20:39,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 30.24/12.86 [2019-03-28 12:20:39,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.24/12.86 [2019-03-28 12:20:39,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 30.24/12.86 [2019-03-28 12:20:39,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:20:39 BasicIcfg 30.24/12.86 [2019-03-28 12:20:39,811 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 30.24/12.86 [2019-03-28 12:20:39,812 INFO L168 Benchmark]: Toolchain (without parser) took 8161.91 ms. Allocated memory was 649.6 MB in the beginning and 849.3 MB in the end (delta: 199.8 MB). Free memory was 559.5 MB in the beginning and 641.8 MB in the end (delta: -82.3 MB). Peak memory consumption was 117.4 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,814 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.34 ms. Allocated memory was 649.6 MB in the beginning and 650.6 MB in the end (delta: 1.0 MB). Free memory was 559.5 MB in the beginning and 618.1 MB in the end (delta: -58.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.75 ms. Allocated memory is still 650.6 MB. Free memory was 618.1 MB in the beginning and 616.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,815 INFO L168 Benchmark]: Boogie Preprocessor took 18.82 ms. Allocated memory is still 650.6 MB. Free memory was 616.8 MB in the beginning and 615.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,816 INFO L168 Benchmark]: RCFGBuilder took 217.80 ms. Allocated memory is still 650.6 MB. Free memory was 615.4 MB in the beginning and 599.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,816 INFO L168 Benchmark]: BlockEncodingV2 took 78.71 ms. Allocated memory is still 650.6 MB. Free memory was 599.7 MB in the beginning and 594.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,817 INFO L168 Benchmark]: TraceAbstraction took 164.20 ms. Allocated memory is still 650.6 MB. Free memory was 594.3 MB in the beginning and 583.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,817 INFO L168 Benchmark]: BuchiAutomizer took 7350.10 ms. Allocated memory was 650.6 MB in the beginning and 849.3 MB in the end (delta: 198.7 MB). Free memory was 583.5 MB in the beginning and 641.8 MB in the end (delta: -58.3 MB). Peak memory consumption was 140.4 MB. Max. memory is 50.3 GB. 30.24/12.86 [2019-03-28 12:20:39,821 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 30.24/12.86 --- Results --- 30.24/12.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 30.24/12.86 - StatisticsResult: Initial Icfg 30.24/12.86 15 locations, 18 edges 30.24/12.86 - StatisticsResult: Encoded RCFG 30.24/12.86 9 locations, 11 edges 30.24/12.86 * Results from de.uni_freiburg.informatik.ultimate.core: 30.24/12.86 - StatisticsResult: Toolchain Benchmarks 30.24/12.86 Benchmark results are: 30.24/12.86 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.24/12.86 * CACSL2BoogieTranslator took 290.34 ms. Allocated memory was 649.6 MB in the beginning and 650.6 MB in the end (delta: 1.0 MB). Free memory was 559.5 MB in the beginning and 618.1 MB in the end (delta: -58.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 50.3 GB. 30.24/12.86 * Boogie Procedure Inliner took 36.75 ms. Allocated memory is still 650.6 MB. Free memory was 618.1 MB in the beginning and 616.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.24/12.86 * Boogie Preprocessor took 18.82 ms. Allocated memory is still 650.6 MB. Free memory was 616.8 MB in the beginning and 615.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.24/12.86 * RCFGBuilder took 217.80 ms. Allocated memory is still 650.6 MB. Free memory was 615.4 MB in the beginning and 599.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 50.3 GB. 30.24/12.86 * BlockEncodingV2 took 78.71 ms. Allocated memory is still 650.6 MB. Free memory was 599.7 MB in the beginning and 594.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 30.24/12.86 * TraceAbstraction took 164.20 ms. Allocated memory is still 650.6 MB. Free memory was 594.3 MB in the beginning and 583.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 30.24/12.86 * BuchiAutomizer took 7350.10 ms. Allocated memory was 650.6 MB in the beginning and 849.3 MB in the end (delta: 198.7 MB). Free memory was 583.5 MB in the beginning and 641.8 MB in the end (delta: -58.3 MB). Peak memory consumption was 140.4 MB. Max. memory is 50.3 GB. 30.24/12.86 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 30.24/12.86 - AllSpecificationsHoldResult: All specifications hold 30.24/12.86 We were not able to verify any specifiation because the program does not contain any specification. 30.24/12.86 - StatisticsResult: Ultimate Automizer benchmark data 30.24/12.86 CFG has 2 procedures, 9 locations, 0 error locations. SAFE Result, 0.1s 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=9occurred 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, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 30.24/12.86 - StatisticsResult: Constructed decomposition of program 30.24/12.86 Your program was decomposed into 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * \old(x) + 211 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * \old(x) + 211 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * \old(x) + 201 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * \old(x) + 90 and consists of 28 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. 30.24/12.86 - StatisticsResult: Timing statistics 30.24/12.86 BüchiAutomizer plugin needed 7.3s and 6 iterations. TraceHistogramMax:13. Analysis of lassos took 2.0s. Construction of modules took 0.6s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 231 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 445 states and ocurred in iteration 4. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/22 HoareTripleCheckerStatistics: 98 SDtfs, 175 SDslu, 148 SDs, 0 SdLazy, 684 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s 30.24/12.86 - TerminationAnalysisResult: Termination proven 30.24/12.86 Buchi Automizer proved that your program is terminating 30.24/12.86 RESULT: Ultimate proved your program to be correct! 30.24/12.86 !SESSION 2019-03-28 12:20:28.319 ----------------------------------------------- 30.24/12.86 eclipse.buildId=unknown 30.24/12.86 java.version=1.8.0_181 30.24/12.86 java.vendor=Oracle Corporation 30.24/12.86 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 30.24/12.86 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.24/12.86 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.24/12.86 30.24/12.86 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:20:40.056 30.24/12.86 !MESSAGE The workspace will exit with unsaved changes in this session. 30.24/12.86 Received shutdown request... 30.24/12.86 Ultimate: 30.24/12.86 GTK+ Version Check 30.24/12.86 EOF