32.29/22.45 YES 32.29/22.45 32.29/22.45 Ultimate: Cannot open display: 32.29/22.45 This is Ultimate 0.1.24-8dc7c08-m 32.29/22.45 [2019-03-28 22:55:18,706 INFO L170 SettingsManager]: Resetting all preferences to default values... 32.29/22.45 [2019-03-28 22:55:18,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 32.29/22.45 [2019-03-28 22:55:18,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 32.29/22.45 [2019-03-28 22:55:18,720 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 32.29/22.45 [2019-03-28 22:55:18,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 32.29/22.45 [2019-03-28 22:55:18,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 32.29/22.45 [2019-03-28 22:55:18,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 32.29/22.45 [2019-03-28 22:55:18,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 32.29/22.45 [2019-03-28 22:55:18,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 32.29/22.45 [2019-03-28 22:55:18,726 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 32.29/22.45 [2019-03-28 22:55:18,726 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 32.29/22.45 [2019-03-28 22:55:18,727 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 32.29/22.45 [2019-03-28 22:55:18,728 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 32.29/22.45 [2019-03-28 22:55:18,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 32.29/22.45 [2019-03-28 22:55:18,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 32.29/22.45 [2019-03-28 22:55:18,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 32.29/22.45 [2019-03-28 22:55:18,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 32.29/22.46 [2019-03-28 22:55:18,734 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 32.29/22.46 [2019-03-28 22:55:18,736 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 32.29/22.46 [2019-03-28 22:55:18,737 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 32.29/22.46 [2019-03-28 22:55:18,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 32.29/22.46 [2019-03-28 22:55:18,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 32.29/22.46 [2019-03-28 22:55:18,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 32.29/22.46 [2019-03-28 22:55:18,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 32.29/22.46 [2019-03-28 22:55:18,741 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 32.29/22.46 [2019-03-28 22:55:18,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 32.29/22.46 [2019-03-28 22:55:18,742 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 32.29/22.46 [2019-03-28 22:55:18,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 32.29/22.46 [2019-03-28 22:55:18,743 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 32.29/22.46 [2019-03-28 22:55:18,744 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 32.29/22.46 [2019-03-28 22:55:18,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 32.29/22.46 [2019-03-28 22:55:18,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 32.29/22.46 [2019-03-28 22:55:18,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 32.29/22.46 [2019-03-28 22:55:18,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 32.29/22.46 [2019-03-28 22:55:18,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 32.29/22.46 [2019-03-28 22:55:18,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 32.29/22.46 [2019-03-28 22:55:18,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 32.29/22.46 [2019-03-28 22:55:18,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 32.29/22.46 [2019-03-28 22:55:18,749 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 32.29/22.46 [2019-03-28 22:55:18,764 INFO L110 SettingsManager]: Loading preferences was successful 32.29/22.46 [2019-03-28 22:55:18,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 32.29/22.46 [2019-03-28 22:55:18,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 32.29/22.46 [2019-03-28 22:55:18,765 INFO L133 SettingsManager]: * Rewrite not-equals=true 32.29/22.46 [2019-03-28 22:55:18,765 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 32.29/22.46 [2019-03-28 22:55:18,766 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 32.29/22.46 [2019-03-28 22:55:18,766 INFO L133 SettingsManager]: * Use SBE=true 32.29/22.46 [2019-03-28 22:55:18,766 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 32.29/22.46 [2019-03-28 22:55:18,766 INFO L133 SettingsManager]: * Use old map elimination=false 32.29/22.46 [2019-03-28 22:55:18,766 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 32.29/22.46 [2019-03-28 22:55:18,767 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 32.29/22.46 [2019-03-28 22:55:18,767 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 32.29/22.46 [2019-03-28 22:55:18,767 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 32.29/22.46 [2019-03-28 22:55:18,767 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 32.29/22.46 [2019-03-28 22:55:18,767 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:18,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 32.29/22.46 [2019-03-28 22:55:18,768 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 32.29/22.46 [2019-03-28 22:55:18,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE 32.29/22.46 [2019-03-28 22:55:18,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 32.29/22.46 [2019-03-28 22:55:18,768 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 32.29/22.46 [2019-03-28 22:55:18,769 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 32.29/22.46 [2019-03-28 22:55:18,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 32.29/22.46 [2019-03-28 22:55:18,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 32.29/22.46 [2019-03-28 22:55:18,769 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 32.29/22.46 [2019-03-28 22:55:18,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 32.29/22.46 [2019-03-28 22:55:18,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 32.29/22.46 [2019-03-28 22:55:18,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 32.29/22.46 [2019-03-28 22:55:18,770 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 32.29/22.46 [2019-03-28 22:55:18,770 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 32.29/22.46 [2019-03-28 22:55:18,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 32.29/22.46 [2019-03-28 22:55:18,809 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 32.29/22.46 [2019-03-28 22:55:18,812 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 32.29/22.46 [2019-03-28 22:55:18,814 INFO L271 PluginConnector]: Initializing CDTParser... 32.29/22.46 [2019-03-28 22:55:18,814 INFO L276 PluginConnector]: CDTParser initialized 32.29/22.46 [2019-03-28 22:55:18,815 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 32.29/22.46 [2019-03-28 22:55:18,884 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/43b0bb893cc74dd6b9a190928f6d8d4c/FLAG76705985d 32.29/22.46 !SESSION 2019-03-28 22:55:16.392 ----------------------------------------------- 32.29/22.46 eclipse.buildId=unknown 32.29/22.46 java.version=1.8.0_181 32.29/22.46 java.vendor=Oracle Corporation 32.29/22.46 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 32.29/22.46 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 32.29/22.46 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 32.29/22.46 32.29/22.46 !ENTRY org.eclipse.cdt.core 1 0 2019-03-28 22:55:19.149 32.29/22.46 !MESSAGE Indexed 'FLAG76705985d' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) 32.29/22.46 [2019-03-28 22:55:19,231 INFO L307 CDTParser]: Found 1 translation units. 32.29/22.46 [2019-03-28 22:55:19,232 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 32.29/22.46 [2019-03-28 22:55:19,238 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/43b0bb893cc74dd6b9a190928f6d8d4c/FLAG76705985d 32.29/22.46 [2019-03-28 22:55:19,674 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/43b0bb893cc74dd6b9a190928f6d8d4c 32.29/22.46 [2019-03-28 22:55:19,686 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 32.29/22.46 [2019-03-28 22:55:19,687 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 32.29/22.46 [2019-03-28 22:55:19,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 32.29/22.46 [2019-03-28 22:55:19,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 32.29/22.46 [2019-03-28 22:55:19,692 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 32.29/22.46 [2019-03-28 22:55:19,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:19,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372b5ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:19,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:19,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 32.29/22.46 [2019-03-28 22:55:19,722 INFO L176 MainTranslator]: Built tables and reachable declarations 32.29/22.46 [2019-03-28 22:55:19,882 INFO L206 PostProcessor]: Analyzing one entry point: main 32.29/22.46 [2019-03-28 22:55:19,888 INFO L191 MainTranslator]: Completed pre-run 32.29/22.46 [2019-03-28 22:55:19,906 INFO L206 PostProcessor]: Analyzing one entry point: main 32.29/22.46 [2019-03-28 22:55:19,984 INFO L195 MainTranslator]: Completed translation 32.29/22.46 [2019-03-28 22:55:19,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19 WrapperNode 32.29/22.46 [2019-03-28 22:55:19,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 32.29/22.46 [2019-03-28 22:55:19,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 32.29/22.46 [2019-03-28 22:55:19,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 32.29/22.46 [2019-03-28 22:55:19,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 32.29/22.46 [2019-03-28 22:55:19,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 32.29/22.46 [2019-03-28 22:55:20,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 32.29/22.46 [2019-03-28 22:55:20,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 32.29/22.46 [2019-03-28 22:55:20,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized 32.29/22.46 [2019-03-28 22:55:20,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 32.29/22.46 [2019-03-28 22:55:20,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 32.29/22.46 [2019-03-28 22:55:20,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... 32.29/22.46 [2019-03-28 22:55:20,045 INFO L276 PluginConnector]: RCFGBuilder initialized 32.29/22.46 [2019-03-28 22:55:20,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (1/1) ... 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 32.29/22.46 [2019-03-28 22:55:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 32.29/22.46 [2019-03-28 22:55:20,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 32.29/22.46 [2019-03-28 22:55:20,260 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 32.29/22.46 [2019-03-28 22:55:20,261 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 32.29/22.46 [2019-03-28 22:55:20,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:55:20 BoogieIcfgContainer 32.29/22.46 [2019-03-28 22:55:20,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 32.29/22.46 [2019-03-28 22:55:20,263 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 32.29/22.46 [2019-03-28 22:55:20,263 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 32.29/22.46 [2019-03-28 22:55:20,266 INFO L276 PluginConnector]: BlockEncodingV2 initialized 32.29/22.46 [2019-03-28 22:55:20,267 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:55:20" (1/1) ... 32.29/22.46 [2019-03-28 22:55:20,282 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges 32.29/22.46 [2019-03-28 22:55:20,284 INFO L258 BlockEncoder]: Using Remove infeasible edges 32.29/22.46 [2019-03-28 22:55:20,285 INFO L263 BlockEncoder]: Using Maximize final states 32.29/22.46 [2019-03-28 22:55:20,285 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 32.29/22.46 [2019-03-28 22:55:20,286 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 32.29/22.46 [2019-03-28 22:55:20,287 INFO L296 BlockEncoder]: Using Remove sink states 32.29/22.46 [2019-03-28 22:55:20,288 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 32.29/22.46 [2019-03-28 22:55:20,289 INFO L179 BlockEncoder]: Using Rewrite not-equals 32.29/22.46 [2019-03-28 22:55:20,306 INFO L185 BlockEncoder]: Using Use SBE 32.29/22.46 [2019-03-28 22:55:20,323 INFO L200 BlockEncoder]: SBE split 2 edges 32.29/22.46 [2019-03-28 22:55:20,328 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 32.29/22.46 [2019-03-28 22:55:20,329 INFO L71 MaximizeFinalStates]: 0 new accepting states 32.29/22.46 [2019-03-28 22:55:20,339 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 32.29/22.46 [2019-03-28 22:55:20,341 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 32.29/22.46 [2019-03-28 22:55:20,343 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 32.29/22.46 [2019-03-28 22:55:20,343 INFO L71 MaximizeFinalStates]: 0 new accepting states 32.29/22.46 [2019-03-28 22:55:20,343 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 32.29/22.46 [2019-03-28 22:55:20,343 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 32.29/22.46 [2019-03-28 22:55:20,344 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges 32.29/22.46 [2019-03-28 22:55:20,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:55:20 BasicIcfg 32.29/22.46 [2019-03-28 22:55:20,344 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 32.29/22.46 [2019-03-28 22:55:20,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 32.29/22.46 [2019-03-28 22:55:20,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... 32.29/22.46 [2019-03-28 22:55:20,349 INFO L276 PluginConnector]: TraceAbstraction initialized 32.29/22.46 [2019-03-28 22:55:20,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:55:19" (1/4) ... 32.29/22.46 [2019-03-28 22:55:20,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4351f5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (2/4) ... 32.29/22.46 [2019-03-28 22:55:20,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4351f5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:55:20" (3/4) ... 32.29/22.46 [2019-03-28 22:55:20,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4351f5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:55:20" (4/4) ... 32.29/22.46 [2019-03-28 22:55:20,353 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 32.29/22.46 [2019-03-28 22:55:20,363 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 32.29/22.46 [2019-03-28 22:55:20,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 32.29/22.46 [2019-03-28 22:55:20,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 32.29/22.46 [2019-03-28 22:55:20,417 INFO L133 ementStrategyFactory]: Using default assertion order modulation 32.29/22.46 [2019-03-28 22:55:20,418 INFO L382 AbstractCegarLoop]: Interprodecural is true 32.29/22.46 [2019-03-28 22:55:20,418 INFO L383 AbstractCegarLoop]: Hoare is true 32.29/22.46 [2019-03-28 22:55:20,418 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 32.29/22.46 [2019-03-28 22:55:20,418 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 32.29/22.46 [2019-03-28 22:55:20,419 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 32.29/22.46 [2019-03-28 22:55:20,419 INFO L387 AbstractCegarLoop]: Difference is false 32.29/22.46 [2019-03-28 22:55:20,419 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 32.29/22.46 [2019-03-28 22:55:20,419 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 32.29/22.46 [2019-03-28 22:55:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. 32.29/22.46 [2019-03-28 22:55:20,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 32.29/22.46 [2019-03-28 22:55:20,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. 32.29/22.46 [2019-03-28 22:55:20,491 INFO L451 ceAbstractionStarter]: At program point L18-1(lines 12 22) the Hoare annotation is: true 32.29/22.46 [2019-03-28 22:55:20,491 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 17) no Hoare annotation was computed. 32.29/22.46 [2019-03-28 22:55:20,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 32.29/22.46 [2019-03-28 22:55:20,492 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 12 22) no Hoare annotation was computed. 32.29/22.46 [2019-03-28 22:55:20,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:55:20 BasicIcfg 32.29/22.46 [2019-03-28 22:55:20,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 32.29/22.46 [2019-03-28 22:55:20,500 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 32.29/22.46 [2019-03-28 22:55:20,501 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 32.29/22.46 [2019-03-28 22:55:20,504 INFO L276 PluginConnector]: BuchiAutomizer initialized 32.29/22.46 [2019-03-28 22:55:20,505 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.29/22.46 [2019-03-28 22:55:20,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:55:19" (1/5) ... 32.29/22.46 [2019-03-28 22:55:20,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ab5d9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.29/22.46 [2019-03-28 22:55:20,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:55:19" (2/5) ... 32.29/22.46 [2019-03-28 22:55:20,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ab5d9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.29/22.46 [2019-03-28 22:55:20,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:55:20" (3/5) ... 32.29/22.46 [2019-03-28 22:55:20,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ab5d9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,507 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.29/22.46 [2019-03-28 22:55:20,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:55:20" (4/5) ... 32.29/22.46 [2019-03-28 22:55:20,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ab5d9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:55:20, skipping insertion in model container 32.29/22.46 [2019-03-28 22:55:20,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 32.29/22.46 [2019-03-28 22:55:20,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:55:20" (5/5) ... 32.29/22.46 [2019-03-28 22:55:20,509 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 32.29/22.46 [2019-03-28 22:55:20,536 INFO L133 ementStrategyFactory]: Using default assertion order modulation 32.29/22.46 [2019-03-28 22:55:20,536 INFO L374 BuchiCegarLoop]: Interprodecural is true 32.29/22.46 [2019-03-28 22:55:20,536 INFO L375 BuchiCegarLoop]: Hoare is true 32.29/22.46 [2019-03-28 22:55:20,536 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 32.29/22.46 [2019-03-28 22:55:20,536 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 32.29/22.46 [2019-03-28 22:55:20,536 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 32.29/22.46 [2019-03-28 22:55:20,537 INFO L379 BuchiCegarLoop]: Difference is false 32.29/22.46 [2019-03-28 22:55:20,537 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 32.29/22.46 [2019-03-28 22:55:20,537 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 32.29/22.46 [2019-03-28 22:55:20,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 32.29/22.46 [2019-03-28 22:55:20,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:20,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.29/22.46 [2019-03-28 22:55:20,558 INFO L119 BuchiIsEmpty]: Starting construction of run 32.29/22.46 [2019-03-28 22:55:20,563 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 32.29/22.46 [2019-03-28 22:55:20,563 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:20,564 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 32.29/22.46 [2019-03-28 22:55:20,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. 32.29/22.46 [2019-03-28 22:55:20,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:20,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.29/22.46 [2019-03-28 22:55:20,565 INFO L119 BuchiIsEmpty]: Starting construction of run 32.29/22.46 [2019-03-28 22:55:20,565 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 32.29/22.46 [2019-03-28 22:55:20,565 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:20,570 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 4#L18-1true 32.29/22.46 [2019-03-28 22:55:20,571 INFO L796 eck$LassoCheckResult]: Loop: 4#L18-1true [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 6#L14true [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 5#L14-2true [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 4#L18-1true 32.29/22.46 [2019-03-28 22:55:20,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:20,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:20,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash 77163, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:20,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:20,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,658 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:20,659 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:20,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:20,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1894414, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:20,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:20,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,732 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:20,732 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:20,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:20,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:20,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:20,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:20,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.29/22.46 [2019-03-28 22:55:20,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 32.29/22.46 [2019-03-28 22:55:20,987 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:20,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:20,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:20,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:20,989 INFO L127 ssoRankerPreferences]: Use exernal solver: true 32.29/22.46 [2019-03-28 22:55:20,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:20,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:20,989 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:20,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 32.29/22.46 [2019-03-28 22:55:20,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:20,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:21,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:21,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:21,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:21,186 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:21,187 INFO L412 LassoAnalysis]: Checking for nontermination... 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:21,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:21,194 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:21,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. 32.29/22.46 [2019-03-28 22:55:21,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:21,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:21,233 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:21,261 INFO L445 LassoAnalysis]: Proved nontermination for one component. 32.29/22.46 [2019-03-28 22:55:21,262 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:21,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:21,267 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:21,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:21,300 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:21,317 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 32.29/22.46 [2019-03-28 22:55:21,341 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:21,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:21,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:21,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:21,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false 32.29/22.46 [2019-03-28 22:55:21,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:21,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:21,342 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:21,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 32.29/22.46 [2019-03-28 22:55:21,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:21,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:21,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:21,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:21,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:21,497 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:21,503 INFO L497 LassoAnalysis]: Using template 'affine'. 32.29/22.46 [2019-03-28 22:55:21,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:21,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:21,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:21,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:21,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:21,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:21,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:21,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.29/22.46 [2019-03-28 22:55:21,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:21,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:21,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:21,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:21,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:21,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:21,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:21,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.29/22.46 [2019-03-28 22:55:21,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:21,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:21,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.29/22.46 [2019-03-28 22:55:21,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:21,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:21,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:21,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:21,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:21,552 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 32.29/22.46 [2019-03-28 22:55:21,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 32.29/22.46 [2019-03-28 22:55:21,563 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. 32.29/22.46 [2019-03-28 22:55:21,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 32.29/22.46 [2019-03-28 22:55:21,565 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 32.29/22.46 [2019-03-28 22:55:21,566 INFO L518 LassoAnalysis]: Proved termination. 32.29/22.46 [2019-03-28 22:55:21,566 INFO L520 LassoAnalysis]: Termination argument consisting of: 32.29/22.46 Ranking function f(ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~MAX~0) = -2*ULTIMATE.start_main_~c~0 + 2*ULTIMATE.start_main_~MAX~0 + 1 32.29/22.46 Supporting invariants [] 32.29/22.46 [2019-03-28 22:55:21,568 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 32.29/22.46 [2019-03-28 22:55:21,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:21,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:21,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:21,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:21,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:21,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:21,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:21,708 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 32.29/22.46 [2019-03-28 22:55:21,714 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 32.29/22.46 [2019-03-28 22:55:21,715 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. 32.29/22.46 [2019-03-28 22:55:22,316 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 22 transitions. Complement of second has 5 states. 32.29/22.46 [2019-03-28 22:55:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 32.29/22.46 [2019-03-28 22:55:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 32.29/22.46 [2019-03-28 22:55:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. 32.29/22.46 [2019-03-28 22:55:22,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:22,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:22,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:22,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:22,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 6 letters. 32.29/22.46 [2019-03-28 22:55:22,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:22,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:22,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 32.29/22.46 [2019-03-28 22:55:22,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 32.29/22.46 [2019-03-28 22:55:22,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:22,341 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 32.29/22.46 [2019-03-28 22:55:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 32.29/22.46 [2019-03-28 22:55:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. 32.29/22.46 [2019-03-28 22:55:22,372 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 20 transitions. 32.29/22.46 [2019-03-28 22:55:22,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 32.29/22.46 [2019-03-28 22:55:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 32.29/22.46 [2019-03-28 22:55:22,376 INFO L87 Difference]: Start difference. First operand 9 states and 20 transitions. Second operand 4 states. 32.29/22.46 [2019-03-28 22:55:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.29/22.46 [2019-03-28 22:55:22,410 INFO L93 Difference]: Finished difference Result 16 states and 33 transitions. 32.29/22.46 [2019-03-28 22:55:22,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 32.29/22.46 [2019-03-28 22:55:22,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 33 transitions. 32.29/22.46 [2019-03-28 22:55:22,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:22,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 33 transitions. 32.29/22.46 [2019-03-28 22:55:22,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 32.29/22.46 [2019-03-28 22:55:22,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 32.29/22.46 [2019-03-28 22:55:22,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 33 transitions. 32.29/22.46 [2019-03-28 22:55:22,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:22,416 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 33 transitions. 32.29/22.46 [2019-03-28 22:55:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 33 transitions. 32.29/22.46 [2019-03-28 22:55:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. 32.29/22.46 [2019-03-28 22:55:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 32.29/22.46 [2019-03-28 22:55:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,419 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,419 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,419 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 32.29/22.46 [2019-03-28 22:55:22,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 22 transitions. 32.29/22.46 [2019-03-28 22:55:22,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:22,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.29/22.46 [2019-03-28 22:55:22,420 INFO L119 BuchiIsEmpty]: Starting construction of run 32.29/22.46 [2019-03-28 22:55:22,421 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:22,421 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:22,421 INFO L794 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 100#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 108#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 105#L14-2 32.29/22.46 [2019-03-28 22:55:22,421 INFO L796 eck$LassoCheckResult]: Loop: 105#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 101#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 102#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 105#L14-2 32.29/22.46 [2019-03-28 22:55:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 61082, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:22,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:22,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,426 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:22,426 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:22,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:22,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 73602, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:22,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,482 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:22,482 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:22,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:22,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1819737673, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:22,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:22,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:22,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,540 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:22,540 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:22,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:22,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:22,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:22,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:22,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. 32.29/22.46 [2019-03-28 22:55:22,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 32.29/22.46 [2019-03-28 22:55:22,679 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:22,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:22,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:22,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:22,680 INFO L127 ssoRankerPreferences]: Use exernal solver: true 32.29/22.46 [2019-03-28 22:55:22,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:22,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:22,681 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:22,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 32.29/22.46 [2019-03-28 22:55:22,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:22,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:22,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:22,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:22,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:22,808 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:22,808 INFO L412 LassoAnalysis]: Checking for nontermination... 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:22,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:22,818 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:22,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. 32.29/22.46 [2019-03-28 22:55:22,847 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:22,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:22,853 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:22,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. 32.29/22.46 [2019-03-28 22:55:22,881 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:22,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:22,887 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:22,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:22,921 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:22,929 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 32.29/22.46 [2019-03-28 22:55:22,954 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:22,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:22,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:22,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:22,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false 32.29/22.46 [2019-03-28 22:55:22,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:22,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:22,955 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:22,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 32.29/22.46 [2019-03-28 22:55:22,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:22,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:22,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:22,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:22,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:23,078 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:23,079 INFO L497 LassoAnalysis]: Using template 'affine'. 32.29/22.46 [2019-03-28 22:55:23,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:23,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:23,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:23,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:23,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:23,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:23,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:23,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.29/22.46 [2019-03-28 22:55:23,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:23,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:23,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:23,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:23,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:23,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:23,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:23,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 32.29/22.46 [2019-03-28 22:55:23,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:23,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:23,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.29/22.46 [2019-03-28 22:55:23,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:23,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:23,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:23,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:23,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:23,105 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 32.29/22.46 [2019-03-28 22:55:23,112 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 32.29/22.46 [2019-03-28 22:55:23,112 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. 32.29/22.46 [2019-03-28 22:55:23,113 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 32.29/22.46 [2019-03-28 22:55:23,113 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 32.29/22.46 [2019-03-28 22:55:23,114 INFO L518 LassoAnalysis]: Proved termination. 32.29/22.46 [2019-03-28 22:55:23,114 INFO L520 LassoAnalysis]: Termination argument consisting of: 32.29/22.46 Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~b~0) = 2*ULTIMATE.start_main_~MAX~0 - 2*ULTIMATE.start_main_~b~0 + 1 32.29/22.46 Supporting invariants [] 32.29/22.46 [2019-03-28 22:55:23,114 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 32.29/22.46 [2019-03-28 22:55:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:23,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:23,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:23,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:23,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:23,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:23,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:23,203 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 32.29/22.46 [2019-03-28 22:55:23,203 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 32.29/22.46 [2019-03-28 22:55:23,203 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 22 transitions. cyclomatic complexity: 13 Second operand 3 states. 32.29/22.46 [2019-03-28 22:55:33,800 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 22 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 48 states and 89 transitions. Complement of second has 12 states. 32.29/22.46 [2019-03-28 22:55:33,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states 32.29/22.46 [2019-03-28 22:55:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 32.29/22.46 [2019-03-28 22:55:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. 32.29/22.46 [2019-03-28 22:55:33,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:33,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:33,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 6 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:33,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:33,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 6 letters. 32.29/22.46 [2019-03-28 22:55:33,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:33,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 89 transitions. 32.29/22.46 [2019-03-28 22:55:33,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 32.29/22.46 [2019-03-28 22:55:33,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 23 states and 42 transitions. 32.29/22.46 [2019-03-28 22:55:33,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 32.29/22.46 [2019-03-28 22:55:33,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 32.29/22.46 [2019-03-28 22:55:33,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 42 transitions. 32.29/22.46 [2019-03-28 22:55:33,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:33,810 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 42 transitions. 32.29/22.46 [2019-03-28 22:55:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 42 transitions. 32.29/22.46 [2019-03-28 22:55:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 32.29/22.46 [2019-03-28 22:55:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 32.29/22.46 [2019-03-28 22:55:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. 32.29/22.46 [2019-03-28 22:55:33,813 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 42 transitions. 32.29/22.46 [2019-03-28 22:55:33,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 32.29/22.46 [2019-03-28 22:55:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 32.29/22.46 [2019-03-28 22:55:33,814 INFO L87 Difference]: Start difference. First operand 23 states and 42 transitions. Second operand 5 states. 32.29/22.46 [2019-03-28 22:55:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.29/22.46 [2019-03-28 22:55:33,851 INFO L93 Difference]: Finished difference Result 43 states and 78 transitions. 32.29/22.46 [2019-03-28 22:55:33,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 32.29/22.46 [2019-03-28 22:55:33,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 78 transitions. 32.29/22.46 [2019-03-28 22:55:33,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 32.29/22.46 [2019-03-28 22:55:33,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 78 transitions. 32.29/22.46 [2019-03-28 22:55:33,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 32.29/22.46 [2019-03-28 22:55:33,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 32.29/22.46 [2019-03-28 22:55:33,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 78 transitions. 32.29/22.46 [2019-03-28 22:55:33,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:33,858 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 78 transitions. 32.29/22.46 [2019-03-28 22:55:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 78 transitions. 32.29/22.46 [2019-03-28 22:55:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. 32.29/22.46 [2019-03-28 22:55:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 32.29/22.46 [2019-03-28 22:55:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. 32.29/22.46 [2019-03-28 22:55:33,862 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 58 transitions. 32.29/22.46 [2019-03-28 22:55:33,862 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 58 transitions. 32.29/22.46 [2019-03-28 22:55:33,879 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 32.29/22.46 [2019-03-28 22:55:33,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 58 transitions. 32.29/22.46 [2019-03-28 22:55:33,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 32.29/22.46 [2019-03-28 22:55:33,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.29/22.46 [2019-03-28 22:55:33,885 INFO L119 BuchiIsEmpty]: Starting construction of run 32.29/22.46 [2019-03-28 22:55:33,885 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 32.29/22.46 [2019-03-28 22:55:33,886 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:33,886 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 298#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 316#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 315#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 299#L18-1 32.29/22.46 [2019-03-28 22:55:33,886 INFO L796 eck$LassoCheckResult]: Loop: 299#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 300#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 303#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 299#L18-1 32.29/22.46 [2019-03-28 22:55:33,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:33,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1893586, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:33,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:33,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:33,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,894 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:33,894 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:33,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash 77296, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:33,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:33,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,953 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:33,953 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:33,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:33,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 577293183, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:34,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:34,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:34,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:34,005 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:34,005 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:34,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:34,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:34,116 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:34,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:34,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:34,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:34,117 INFO L127 ssoRankerPreferences]: Use exernal solver: true 32.29/22.46 [2019-03-28 22:55:34,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:34,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:34,117 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:34,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 32.29/22.46 [2019-03-28 22:55:34,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:34,118 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:34,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:34,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:34,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:34,254 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:34,254 INFO L412 LassoAnalysis]: Checking for nontermination... 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:34,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:34,259 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:34,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. 32.29/22.46 [2019-03-28 22:55:34,286 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:34,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:34,291 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:34,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:34,322 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:34,328 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 32.29/22.46 [2019-03-28 22:55:34,354 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:34,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:34,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:34,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:34,355 INFO L127 ssoRankerPreferences]: Use exernal solver: false 32.29/22.46 [2019-03-28 22:55:34,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:34,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:34,355 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:34,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 32.29/22.46 [2019-03-28 22:55:34,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:34,356 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:34,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:34,679 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 20 32.29/22.46 [2019-03-28 22:55:34,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:34,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:35,509 WARN L188 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 21 32.29/22.46 [2019-03-28 22:55:35,956 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 21 32.29/22.46 [2019-03-28 22:55:35,964 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:35,964 INFO L497 LassoAnalysis]: Using template 'affine'. 32.29/22.46 [2019-03-28 22:55:35,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:35,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:35,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.29/22.46 [2019-03-28 22:55:35,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:35,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:35,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:35,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:35,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:35,972 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 32.29/22.46 [2019-03-28 22:55:35,979 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 32.29/22.46 [2019-03-28 22:55:35,979 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 32.29/22.46 [2019-03-28 22:55:35,979 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 32.29/22.46 [2019-03-28 22:55:35,980 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 32.29/22.46 [2019-03-28 22:55:35,980 INFO L518 LassoAnalysis]: Proved termination. 32.29/22.46 [2019-03-28 22:55:35,980 INFO L520 LassoAnalysis]: Termination argument consisting of: 32.29/22.46 Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~a~0) = 1*ULTIMATE.start_main_~MAX~0 - 1*ULTIMATE.start_main_~a~0 32.29/22.46 Supporting invariants [] 32.29/22.46 [2019-03-28 22:55:35,980 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 32.29/22.46 [2019-03-28 22:55:35,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,033 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,035 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 32.29/22.46 [2019-03-28 22:55:36,035 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 32.29/22.46 [2019-03-28 22:55:36,035 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 58 transitions. cyclomatic complexity: 30 Second operand 4 states. 32.29/22.46 [2019-03-28 22:55:36,485 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 58 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 80 states and 143 transitions. Complement of second has 14 states. 32.29/22.46 [2019-03-28 22:55:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 32.29/22.46 [2019-03-28 22:55:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 32.29/22.46 [2019-03-28 22:55:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. 32.29/22.46 [2019-03-28 22:55:36,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:36,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:36,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:36,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:36,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 4 letters. Loop has 6 letters. 32.29/22.46 [2019-03-28 22:55:36,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:36,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 143 transitions. 32.29/22.46 [2019-03-28 22:55:36,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:36,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 33 states and 59 transitions. 32.29/22.46 [2019-03-28 22:55:36,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 32.29/22.46 [2019-03-28 22:55:36,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 32.29/22.46 [2019-03-28 22:55:36,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 59 transitions. 32.29/22.46 [2019-03-28 22:55:36,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:36,494 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 59 transitions. 32.29/22.46 [2019-03-28 22:55:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 59 transitions. 32.29/22.46 [2019-03-28 22:55:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. 32.29/22.46 [2019-03-28 22:55:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 32.29/22.46 [2019-03-28 22:55:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. 32.29/22.46 [2019-03-28 22:55:36,497 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 37 transitions. 32.29/22.46 [2019-03-28 22:55:36,497 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 37 transitions. 32.29/22.46 [2019-03-28 22:55:36,497 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 32.29/22.46 [2019-03-28 22:55:36,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 37 transitions. 32.29/22.46 [2019-03-28 22:55:36,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:36,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.29/22.46 [2019-03-28 22:55:36,498 INFO L119 BuchiIsEmpty]: Starting construction of run 32.29/22.46 [2019-03-28 22:55:36,499 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1] 32.29/22.46 [2019-03-28 22:55:36,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:36,499 INFO L794 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 474#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 475#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 490#L14-2 [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 489#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 487#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 485#L14-2 [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 483#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 482#L14 32.29/22.46 [2019-03-28 22:55:36,500 INFO L796 eck$LassoCheckResult]: Loop: 482#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 478#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 479#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 482#L14 32.29/22.46 [2019-03-28 22:55:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 707877777, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:36,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:36,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:36,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,504 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:36,504 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:36,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:36,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 32.29/22.46 [2019-03-28 22:55:36,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 32.29/22.46 [2019-03-28 22:55:36,558 INFO L799 eck$LassoCheckResult]: stem already infeasible 32.29/22.46 [2019-03-28 22:55:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash 68682, now seen corresponding path program 2 times 32.29/22.46 [2019-03-28 22:55:36,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:36,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:36,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:36,563 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:36,563 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:36,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:36,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 32.29/22.46 [2019-03-28 22:55:36,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) 32.29/22.46 [2019-03-28 22:55:36,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:36,642 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:36,642 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:36,642 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:36,643 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:36,643 INFO L127 ssoRankerPreferences]: Use exernal solver: true 32.29/22.46 [2019-03-28 22:55:36,643 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:36,643 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:36,643 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:36,643 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 32.29/22.46 [2019-03-28 22:55:36,643 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:36,644 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:36,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:36,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:36,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:36,720 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:36,721 INFO L412 LassoAnalysis]: Checking for nontermination... 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:36,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:36,724 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:36,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:36,753 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:36,760 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 32.29/22.46 [2019-03-28 22:55:36,784 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:36,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:36,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:36,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:36,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false 32.29/22.46 [2019-03-28 22:55:36,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:36,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:36,785 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:36,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 32.29/22.46 [2019-03-28 22:55:36,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:36,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:36,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:36,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:36,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:36,861 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:36,862 INFO L497 LassoAnalysis]: Using template 'affine'. 32.29/22.46 [2019-03-28 22:55:36,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:36,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:36,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.29/22.46 [2019-03-28 22:55:36,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:36,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:36,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:36,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:36,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:36,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 32.29/22.46 [2019-03-28 22:55:36,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 32.29/22.46 [2019-03-28 22:55:36,879 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 32.29/22.46 [2019-03-28 22:55:36,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 32.29/22.46 [2019-03-28 22:55:36,880 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 32.29/22.46 [2019-03-28 22:55:36,880 INFO L518 LassoAnalysis]: Proved termination. 32.29/22.46 [2019-03-28 22:55:36,880 INFO L520 LassoAnalysis]: Termination argument consisting of: 32.29/22.46 Ranking function f(ULTIMATE.start_main_~b~0, ULTIMATE.start_main_~MAX~0) = -1*ULTIMATE.start_main_~b~0 + 1*ULTIMATE.start_main_~MAX~0 32.29/22.46 Supporting invariants [] 32.29/22.46 [2019-03-28 22:55:36,881 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 32.29/22.46 [2019-03-28 22:55:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:36,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:36,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:36,935 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 32.29/22.46 [2019-03-28 22:55:36,935 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 32.29/22.46 [2019-03-28 22:55:36,935 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 37 transitions. cyclomatic complexity: 19 Second operand 4 states. 32.29/22.46 [2019-03-28 22:55:37,019 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 37 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 191 states and 342 transitions. Complement of second has 39 states. 32.29/22.46 [2019-03-28 22:55:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states 32.29/22.46 [2019-03-28 22:55:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 32.29/22.46 [2019-03-28 22:55:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. 32.29/22.46 [2019-03-28 22:55:37,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:37,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:37,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:37,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:37,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 8 letters. Loop has 6 letters. 32.29/22.46 [2019-03-28 22:55:37,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:37,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 342 transitions. 32.29/22.46 [2019-03-28 22:55:37,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:37,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 60 states and 105 transitions. 32.29/22.46 [2019-03-28 22:55:37,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 32.29/22.46 [2019-03-28 22:55:37,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 32.29/22.46 [2019-03-28 22:55:37,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 105 transitions. 32.29/22.46 [2019-03-28 22:55:37,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:37,029 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 105 transitions. 32.29/22.46 [2019-03-28 22:55:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 105 transitions. 32.29/22.46 [2019-03-28 22:55:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 27. 32.29/22.46 [2019-03-28 22:55:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 32.29/22.46 [2019-03-28 22:55:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 48 transitions. 32.29/22.46 [2019-03-28 22:55:37,033 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 48 transitions. 32.29/22.46 [2019-03-28 22:55:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 32.29/22.46 [2019-03-28 22:55:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 32.29/22.46 [2019-03-28 22:55:37,033 INFO L87 Difference]: Start difference. First operand 27 states and 48 transitions. Second operand 3 states. 32.29/22.46 [2019-03-28 22:55:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.29/22.46 [2019-03-28 22:55:37,049 INFO L93 Difference]: Finished difference Result 31 states and 53 transitions. 32.29/22.46 [2019-03-28 22:55:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 32.29/22.46 [2019-03-28 22:55:37,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 53 transitions. 32.29/22.46 [2019-03-28 22:55:37,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:37,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 52 transitions. 32.29/22.46 [2019-03-28 22:55:37,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 32.29/22.46 [2019-03-28 22:55:37,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 32.29/22.46 [2019-03-28 22:55:37,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 52 transitions. 32.29/22.46 [2019-03-28 22:55:37,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 32.29/22.46 [2019-03-28 22:55:37,054 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 52 transitions. 32.29/22.46 [2019-03-28 22:55:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 52 transitions. 32.29/22.46 [2019-03-28 22:55:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. 32.29/22.46 [2019-03-28 22:55:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 32.29/22.46 [2019-03-28 22:55:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. 32.29/22.46 [2019-03-28 22:55:37,056 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 41 transitions. 32.29/22.46 [2019-03-28 22:55:37,057 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 41 transitions. 32.29/22.46 [2019-03-28 22:55:37,057 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 32.29/22.46 [2019-03-28 22:55:37,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 41 transitions. 32.29/22.46 [2019-03-28 22:55:37,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 32.29/22.46 [2019-03-28 22:55:37,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 32.29/22.46 [2019-03-28 22:55:37,058 INFO L119 BuchiIsEmpty]: Starting construction of run 32.29/22.46 [2019-03-28 22:55:37,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] 32.29/22.46 [2019-03-28 22:55:37,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 32.29/22.46 [2019-03-28 22:55:37,059 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L18-1: Formula: (and (= v_ULTIMATE.start_main_~a~0_1 1) (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~MAX~0_1 1000) (= v_ULTIMATE.start_main_~b~0_1 1)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_1, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_1, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 865#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 866#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 886#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 867#L18-1 [47] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (< (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 868#L14 [43] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~MAX~0_11 v_ULTIMATE.start_main_~a~0_11) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_11, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_11} AuxVars[] AssignedVars[] 871#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 872#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 878#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 879#L14-2 [35] L14-2-->L18-1: Formula: (and (< v_ULTIMATE.start_main_~MAX~0_6 v_ULTIMATE.start_main_~b~0_7) (= v_ULTIMATE.start_main_~b~0_6 1) (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_6, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~b~0] 874#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 873#L14 32.29/22.46 [2019-03-28 22:55:37,059 INFO L796 eck$LassoCheckResult]: Loop: 873#L14 [39] L14-->L14-2: Formula: (and (= v_ULTIMATE.start_main_~b~0_11 (+ v_ULTIMATE.start_main_~b~0_12 1)) (= v_ULTIMATE.start_main_~a~0_9 1) (< v_ULTIMATE.start_main_~MAX~0_10 v_ULTIMATE.start_main_~a~0_10)) InVars {ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_10, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_12} OutVars{ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_9, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_10, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~b~0] 869#L14-2 [44] L14-2-->L18-1: Formula: (>= v_ULTIMATE.start_main_~MAX~0_7 v_ULTIMATE.start_main_~b~0_8) InVars {ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} OutVars{ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_7, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_8} AuxVars[] AssignedVars[] 870#L18-1 [48] L18-1-->L14: Formula: (and (= v_ULTIMATE.start_main_~a~0_7 (+ v_ULTIMATE.start_main_~a~0_8 1)) (<= v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~MAX~0_9) (> (* (* v_ULTIMATE.start_main_~a~0_8 v_ULTIMATE.start_main_~a~0_8) v_ULTIMATE.start_main_~a~0_8) (+ (* (* v_ULTIMATE.start_main_~b~0_10 v_ULTIMATE.start_main_~b~0_10) v_ULTIMATE.start_main_~b~0_10) (* (* v_ULTIMATE.start_main_~c~0_9 v_ULTIMATE.start_main_~c~0_9) v_ULTIMATE.start_main_~c~0_9)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_8, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~a~0=v_ULTIMATE.start_main_~a~0_7, ULTIMATE.start_main_~MAX~0=v_ULTIMATE.start_main_~MAX~0_9, ULTIMATE.start_main_~b~0=v_ULTIMATE.start_main_~b~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~a~0] 873#L14 32.29/22.46 [2019-03-28 22:55:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1388764830, now seen corresponding path program 1 times 32.29/22.46 [2019-03-28 22:55:37,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:37,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,063 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:37,063 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:37,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:37,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:37,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. 32.29/22.46 [2019-03-28 22:55:37,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 32.29/22.46 [2019-03-28 22:55:37,144 INFO L799 eck$LassoCheckResult]: stem already infeasible 32.29/22.46 [2019-03-28 22:55:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 68682, now seen corresponding path program 3 times 32.29/22.46 [2019-03-28 22:55:37,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 32.29/22.46 [2019-03-28 22:55:37,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 32.29/22.46 [2019-03-28 22:55:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 32.29/22.46 [2019-03-28 22:55:37,149 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 32.29/22.46 [2019-03-28 22:55:37,149 INFO L258 seRefinementStrategy]: Advancing trace checker 32.29/22.46 [2019-03-28 22:55:37,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 32.29/22.46 [2019-03-28 22:55:37,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 32.29/22.46 [2019-03-28 22:55:37,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) 32.29/22.46 [2019-03-28 22:55:37,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 32.29/22.46 [2019-03-28 22:55:37,230 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:37,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:37,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:37,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:37,231 INFO L127 ssoRankerPreferences]: Use exernal solver: true 32.29/22.46 [2019-03-28 22:55:37,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:37,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:37,231 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:37,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 32.29/22.46 [2019-03-28 22:55:37,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:37,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:37,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:37,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:37,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:37,307 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:37,307 INFO L412 LassoAnalysis]: Checking for nontermination... 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:37,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:37,311 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 32.29/22.46 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 32.29/22.46 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:37,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 32.29/22.46 [2019-03-28 22:55:37,340 INFO L163 nArgumentSynthesizer]: Using integer mode. 32.29/22.46 [2019-03-28 22:55:37,347 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 32.29/22.46 [2019-03-28 22:55:37,370 INFO L216 LassoAnalysis]: Preferences: 32.29/22.46 [2019-03-28 22:55:37,370 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 32.29/22.46 [2019-03-28 22:55:37,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 32.29/22.46 [2019-03-28 22:55:37,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 32.29/22.46 [2019-03-28 22:55:37,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false 32.29/22.46 [2019-03-28 22:55:37,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 32.29/22.46 [2019-03-28 22:55:37,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 32.29/22.46 [2019-03-28 22:55:37,371 INFO L130 ssoRankerPreferences]: Path of dumped script: 32.29/22.46 [2019-03-28 22:55:37,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 32.29/22.46 [2019-03-28 22:55:37,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 32.29/22.46 [2019-03-28 22:55:37,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 32.29/22.46 [2019-03-28 22:55:37,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:37,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:37,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 32.29/22.46 [2019-03-28 22:55:37,452 INFO L300 LassoAnalysis]: Preprocessing complete. 32.29/22.46 [2019-03-28 22:55:37,453 INFO L497 LassoAnalysis]: Using template 'affine'. 32.29/22.46 [2019-03-28 22:55:37,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 32.29/22.46 Termination analysis: LINEAR_WITH_GUESSES 32.29/22.46 Number of strict supporting invariants: 0 32.29/22.46 Number of non-strict supporting invariants: 1 32.29/22.46 Consider only non-deceasing supporting invariants: true 32.29/22.46 Simplify termination arguments: true 32.29/22.46 Simplify supporting invariants: trueOverapproximate stem: false 32.29/22.46 [2019-03-28 22:55:37,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. 32.29/22.46 [2019-03-28 22:55:37,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 32.29/22.46 [2019-03-28 22:55:37,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 32.29/22.46 [2019-03-28 22:55:37,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 32.29/22.46 [2019-03-28 22:55:37,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 32.29/22.46 [2019-03-28 22:55:37,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 32.29/22.46 [2019-03-28 22:55:37,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 32.29/22.46 [2019-03-28 22:55:37,461 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 32.29/22.46 [2019-03-28 22:55:37,467 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 32.29/22.46 [2019-03-28 22:55:37,467 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 32.29/22.46 [2019-03-28 22:55:37,468 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 32.29/22.46 [2019-03-28 22:55:37,468 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 32.29/22.46 [2019-03-28 22:55:37,468 INFO L518 LassoAnalysis]: Proved termination. 32.29/22.46 [2019-03-28 22:55:37,468 INFO L520 LassoAnalysis]: Termination argument consisting of: 32.29/22.46 Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~b~0) = 1*ULTIMATE.start_main_~MAX~0 - 1*ULTIMATE.start_main_~b~0 32.29/22.46 Supporting invariants [] 32.29/22.46 [2019-03-28 22:55:37,469 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 32.29/22.46 [2019-03-28 22:55:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 32.29/22.46 [2019-03-28 22:55:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:37,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:37,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:37,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:37,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 32.29/22.46 [2019-03-28 22:55:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 32.29/22.46 [2019-03-28 22:55:37,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core 32.29/22.46 [2019-03-28 22:55:37,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... 32.29/22.46 [2019-03-28 22:55:37,529 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 32.29/22.46 [2019-03-28 22:55:37,529 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 32.29/22.46 [2019-03-28 22:55:37,529 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 41 transitions. cyclomatic complexity: 20 Second operand 4 states. 32.29/22.46 [2019-03-28 22:55:37,613 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 41 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 151 states and 261 transitions. Complement of second has 39 states. 32.29/22.46 [2019-03-28 22:55:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 3 non-accepting loop states 2 accepting loop states 32.29/22.46 [2019-03-28 22:55:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 32.29/22.46 [2019-03-28 22:55:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. 32.29/22.46 [2019-03-28 22:55:37,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:37,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:37,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. 32.29/22.46 [2019-03-28 22:55:37,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:37,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. 32.29/22.46 [2019-03-28 22:55:37,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. 32.29/22.46 [2019-03-28 22:55:37,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 261 transitions. 32.29/22.46 [2019-03-28 22:55:37,619 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 32.29/22.46 [2019-03-28 22:55:37,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 32.29/22.46 [2019-03-28 22:55:37,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 32.29/22.46 [2019-03-28 22:55:37,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 32.29/22.46 [2019-03-28 22:55:37,620 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,620 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 32.29/22.46 [2019-03-28 22:55:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 32.29/22.46 [2019-03-28 22:55:37,621 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. 32.29/22.46 [2019-03-28 22:55:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 32.29/22.46 [2019-03-28 22:55:37,621 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 32.29/22.46 [2019-03-28 22:55:37,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 32.29/22.46 [2019-03-28 22:55:37,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 32.29/22.46 [2019-03-28 22:55:37,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 32.29/22.46 [2019-03-28 22:55:37,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 32.29/22.46 [2019-03-28 22:55:37,623 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,623 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,623 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,623 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 32.29/22.46 [2019-03-28 22:55:37,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 32.29/22.46 [2019-03-28 22:55:37,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 32.29/22.46 [2019-03-28 22:55:37,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 32.29/22.46 [2019-03-28 22:55:37,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:55:37 BasicIcfg 32.29/22.46 [2019-03-28 22:55:37,630 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 32.29/22.46 [2019-03-28 22:55:37,630 INFO L168 Benchmark]: Toolchain (without parser) took 17944.25 ms. Allocated memory was 649.6 MB in the beginning and 742.9 MB in the end (delta: 93.3 MB). Free memory was 557.4 MB in the beginning and 426.0 MB in the end (delta: 131.4 MB). Peak memory consumption was 224.7 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,631 INFO L168 Benchmark]: CDTParser took 0.17 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. 32.29/22.46 [2019-03-28 22:55:37,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.43 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 557.4 MB in the beginning and 641.1 MB in the end (delta: -83.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 673.7 MB. Free memory was 641.1 MB in the beginning and 639.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,633 INFO L168 Benchmark]: Boogie Preprocessor took 20.22 ms. Allocated memory is still 673.7 MB. Free memory was 639.7 MB in the beginning and 636.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,633 INFO L168 Benchmark]: RCFGBuilder took 218.15 ms. Allocated memory is still 673.7 MB. Free memory was 636.6 MB in the beginning and 624.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,634 INFO L168 Benchmark]: BlockEncodingV2 took 81.39 ms. Allocated memory is still 673.7 MB. Free memory was 624.1 MB in the beginning and 617.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,634 INFO L168 Benchmark]: TraceAbstraction took 154.74 ms. Allocated memory is still 673.7 MB. Free memory was 617.6 MB in the beginning and 608.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,635 INFO L168 Benchmark]: BuchiAutomizer took 17129.50 ms. Allocated memory was 673.7 MB in the beginning and 742.9 MB in the end (delta: 69.2 MB). Free memory was 608.2 MB in the beginning and 426.0 MB in the end (delta: 182.2 MB). Peak memory consumption was 251.4 MB. Max. memory is 50.3 GB. 32.29/22.46 [2019-03-28 22:55:37,639 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 32.29/22.46 --- Results --- 32.29/22.46 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 32.29/22.46 - StatisticsResult: Initial Icfg 32.29/22.46 8 locations, 11 edges 32.29/22.46 - StatisticsResult: Encoded RCFG 32.29/22.46 4 locations, 7 edges 32.29/22.46 * Results from de.uni_freiburg.informatik.ultimate.core: 32.29/22.46 - StatisticsResult: Toolchain Benchmarks 32.29/22.46 Benchmark results are: 32.29/22.46 * CDTParser took 0.17 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. 32.29/22.46 * CACSL2BoogieTranslator took 296.43 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 557.4 MB in the beginning and 641.1 MB in the end (delta: -83.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 32.29/22.46 * Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 673.7 MB. Free memory was 641.1 MB in the beginning and 639.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 32.29/22.46 * Boogie Preprocessor took 20.22 ms. Allocated memory is still 673.7 MB. Free memory was 639.7 MB in the beginning and 636.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 32.29/22.46 * RCFGBuilder took 218.15 ms. Allocated memory is still 673.7 MB. Free memory was 636.6 MB in the beginning and 624.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 50.3 GB. 32.29/22.46 * BlockEncodingV2 took 81.39 ms. Allocated memory is still 673.7 MB. Free memory was 624.1 MB in the beginning and 617.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 32.29/22.46 * TraceAbstraction took 154.74 ms. Allocated memory is still 673.7 MB. Free memory was 617.6 MB in the beginning and 608.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 32.29/22.46 * BuchiAutomizer took 17129.50 ms. Allocated memory was 673.7 MB in the beginning and 742.9 MB in the end (delta: 69.2 MB). Free memory was 608.2 MB in the beginning and 426.0 MB in the end (delta: 182.2 MB). Peak memory consumption was 251.4 MB. Max. memory is 50.3 GB. 32.29/22.46 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 32.29/22.46 - AllSpecificationsHoldResult: All specifications hold 32.29/22.46 We were not able to verify any specifiation because the program does not contain any specification. 32.29/22.46 - InvariantResult [Line: 12]: Loop Invariant 32.29/22.46 Derived loop invariant: 1 32.29/22.46 - StatisticsResult: Ultimate Automizer benchmark data 32.29/22.46 CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 32.29/22.46 - StatisticsResult: Constructed decomposition of program 32.29/22.46 Your program was decomposed into 9 terminating modules (4 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -2 * c + 2 * MAX + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * MAX + -2 * b + 1 and consists of 4 locations. One nondeterministic module has affine ranking function MAX + -1 * a and consists of 5 locations. One nondeterministic module has affine ranking function -1 * b + MAX and consists of 7 locations. One nondeterministic module has affine ranking function MAX + -1 * b and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. 32.29/22.46 - StatisticsResult: Timing statistics 32.29/22.46 BüchiAutomizer plugin needed 17.0s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.5s. Construction of modules took 11.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 2. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 85 SDslu, 0 SDs, 0 SdLazy, 200 SolverSat, 34 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 11.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital35 mio100 ax134 hnf100 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq127 hnf95 smp100 dnf100 smp100 tf104 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s 32.29/22.46 - TerminationAnalysisResult: Termination proven 32.29/22.46 Buchi Automizer proved that your program is terminating 32.29/22.46 RESULT: Ultimate proved your program to be correct! 32.29/22.46 32.29/22.46 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:55:37.869 32.29/22.46 !MESSAGE The workspace will exit with unsaved changes in this session. 32.29/22.46 Received shutdown request... 32.29/22.46 Ultimate: 32.29/22.46 GTK+ Version Check 32.29/22.46 EOF