./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e6c4332f1874752b59e29803328ba77ee4005585 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:00:42,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:00:42,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:00:42,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:00:42,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:00:42,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:00:42,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:00:42,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:00:42,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:00:42,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:00:42,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:00:42,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:00:42,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:00:42,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:00:42,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:00:42,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:00:42,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:00:42,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:00:42,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:00:42,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:00:42,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:00:42,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:00:42,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:00:42,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:00:42,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:00:42,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:00:42,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:00:42,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:00:42,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:00:42,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:00:42,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:00:42,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:00:42,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:00:42,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:00:42,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:00:42,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:00:42,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:00:42,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:00:42,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:00:42,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:00:42,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:00:42,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:00:42,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:00:42,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:00:42,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:00:42,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:00:42,366 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:00:42,366 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:00:42,366 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:00:42,367 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:00:42,367 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:00:42,367 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:00:42,368 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:00:42,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:00:42,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:00:42,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:00:42,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:00:42,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:00:42,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:00:42,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:00:42,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:00:42,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:00:42,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:00:42,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:00:42,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:00:42,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:00:42,372 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:00:42,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:00:42,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:00:42,373 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:00:42,375 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:00:42,375 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6c4332f1874752b59e29803328ba77ee4005585 [2019-11-28 03:00:42,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:00:42,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:00:42,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:00:42,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:00:42,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:00:42,689 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2019-11-28 03:00:42,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5028bf70e/a1ce2c24e0164359b1183a84f30461d5/FLAG85d82db06 [2019-11-28 03:00:43,285 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:00:43,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2019-11-28 03:00:43,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5028bf70e/a1ce2c24e0164359b1183a84f30461d5/FLAG85d82db06 [2019-11-28 03:00:43,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5028bf70e/a1ce2c24e0164359b1183a84f30461d5 [2019-11-28 03:00:43,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:00:43,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:00:43,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:00:43,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:00:43,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:00:43,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:43" (1/1) ... [2019-11-28 03:00:43,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3eb5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:43, skipping insertion in model container [2019-11-28 03:00:43,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:43" (1/1) ... [2019-11-28 03:00:43,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:00:43,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:00:44,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:00:44,118 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:00:44,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:00:44,224 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:00:44,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44 WrapperNode [2019-11-28 03:00:44,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:00:44,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:00:44,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:00:44,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:00:44,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:00:44,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:00:44,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:00:44,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:00:44,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... [2019-11-28 03:00:44,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:00:44,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:00:44,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:00:44,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:00:44,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:00:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:00:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:00:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:00:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:00:44,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:00:44,853 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:00:44,853 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:00:44,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:44 BoogieIcfgContainer [2019-11-28 03:00:44,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:00:44,855 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:00:44,855 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:00:44,858 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:00:44,859 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:44,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:00:43" (1/3) ... [2019-11-28 03:00:44,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2344a57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:44, skipping insertion in model container [2019-11-28 03:00:44,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:44,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:44" (2/3) ... [2019-11-28 03:00:44,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2344a57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:44, skipping insertion in model container [2019-11-28 03:00:44,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:00:44,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:44" (3/3) ... [2019-11-28 03:00:44,863 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2019-11-28 03:00:44,901 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:00:44,901 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:00:44,901 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:00:44,901 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:00:44,903 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:00:44,903 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:00:44,903 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:00:44,903 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:00:44,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:00:44,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:44,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:44,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:44,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:00:44,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:44,942 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:00:44,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:00:44,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:44,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:44,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:44,945 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:00:44,945 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:44,951 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4#L557-20true [2019-11-28 03:00:44,951 INFO L796 eck$LassoCheckResult]: Loop: 4#L557-20true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 7#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 10#L557-3true test_fun_#t~short14 := test_fun_#t~short9; 13#L557-4true assume test_fun_#t~short14; 3#L557-9true test_fun_#t~short18 := test_fun_#t~short14; 5#L557-10true assume !test_fun_#t~short18; 8#L557-12true test_fun_#t~short20 := test_fun_#t~short18; 9#L557-13true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 14#L557-15true test_fun_#t~short22 := test_fun_#t~short20; 16#L557-16true assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 4#L557-20true [2019-11-28 03:00:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:00:44,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:44,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173851806] [2019-11-28 03:00:44,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2019-11-28 03:00:45,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:45,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064212246] [2019-11-28 03:00:45,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:45,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064212246] [2019-11-28 03:00:45,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:45,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:00:45,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463221929] [2019-11-28 03:00:45,264 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:45,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:45,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:45,279 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2019-11-28 03:00:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:45,367 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-28 03:00:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:00:45,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-28 03:00:45,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-28 03:00:45,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2019-11-28 03:00:45,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:00:45,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:00:45,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-28 03:00:45,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:00:45,384 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 03:00:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-28 03:00:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-11-28 03:00:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:00:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 03:00:45,416 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:00:45,416 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:00:45,416 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:00:45,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 03:00:45,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 03:00:45,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:45,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:45,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:00:45,421 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:45,422 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 68#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 61#L557-20 [2019-11-28 03:00:45,422 INFO L796 eck$LassoCheckResult]: Loop: 61#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 62#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 64#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 67#L557-4 assume test_fun_#t~short14; 59#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 60#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 63#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 65#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 66#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 70#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 72#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 61#L557-20 [2019-11-28 03:00:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:00:45,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:45,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920173572] [2019-11-28 03:00:45,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2019-11-28 03:00:45,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:45,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680640669] [2019-11-28 03:00:45,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2019-11-28 03:00:45,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:45,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431540918] [2019-11-28 03:00:45,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:45,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:46,150 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2019-11-28 03:00:46,959 WARN L192 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2019-11-28 03:00:47,229 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-28 03:00:47,244 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:00:47,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:00:47,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:00:47,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:00:47,246 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:00:47,246 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:47,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:00:47,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:00:47,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2019-11-28 03:00:47,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:00:47,247 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:00:47,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:47,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,017 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-11-28 03:00:48,196 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 03:00:48,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:48,579 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-28 03:00:48,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:00:48,991 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:48,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:48,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:48,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:49,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:49,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:49,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:49,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:49,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:49,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:49,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:49,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:49,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:49,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:49,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:49,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:49,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:49,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:49,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:49,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:00:49,560 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 03:00:49,560 INFO L444 ModelExtractionUtils]: 14 out of 40 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:00:49,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:49,621 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:00:49,621 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:00:49,622 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2019-11-28 03:00:49,824 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-28 03:00:49,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:00:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:49,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:00:49,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:49,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:00:49,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:49,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:50,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 03:00:50,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 03:00:50,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 73 states and 101 transitions. Complement of second has 12 states. [2019-11-28 03:00:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:00:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:00:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2019-11-28 03:00:50,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2019-11-28 03:00:50,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:50,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2019-11-28 03:00:50,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:50,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2019-11-28 03:00:50,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:00:50,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2019-11-28 03:00:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-28 03:00:50,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2019-11-28 03:00:50,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 03:00:50,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 03:00:50,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2019-11-28 03:00:50,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:50,387 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-11-28 03:00:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2019-11-28 03:00:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2019-11-28 03:00:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 03:00:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2019-11-28 03:00:50,393 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2019-11-28 03:00:50,393 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2019-11-28 03:00:50,393 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:00:50,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2019-11-28 03:00:50,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 03:00:50,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:50,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:50,395 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:00:50,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:50,396 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 409#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 410#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2019-11-28 03:00:50,396 INFO L796 eck$LassoCheckResult]: Loop: 393#L557-1 assume !test_fun_#t~short9; 400#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 407#L557-4 assume test_fun_#t~short14; 423#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 396#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 397#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 403#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 405#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 415#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 418#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 392#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2019-11-28 03:00:50,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-28 03:00:50,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668307580] [2019-11-28 03:00:50,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,438 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,438 INFO L82 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2019-11-28 03:00:50,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786999300] [2019-11-28 03:00:50,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:50,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786999300] [2019-11-28 03:00:50,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:50,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:00:50,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845079407] [2019-11-28 03:00:50,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:50,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:50,478 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 03:00:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:50,521 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2019-11-28 03:00:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:50,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2019-11-28 03:00:50,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-28 03:00:50,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2019-11-28 03:00:50,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 03:00:50,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 03:00:50,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2019-11-28 03:00:50,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:50,530 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-11-28 03:00:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2019-11-28 03:00:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-11-28 03:00:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:00:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-28 03:00:50,534 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 03:00:50,534 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 03:00:50,535 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:00:50,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-11-28 03:00:50,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:50,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:50,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:50,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:00:50,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:50,541 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 520#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 521#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2019-11-28 03:00:50,541 INFO L796 eck$LassoCheckResult]: Loop: 506#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 511#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 518#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 522#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 529#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 501#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 502#L557-10 assume !test_fun_#t~short18; 509#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 514#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 516#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 524#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 527#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 505#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2019-11-28 03:00:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-28 03:00:50,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625641410] [2019-11-28 03:00:50,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2019-11-28 03:00:50,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971227232] [2019-11-28 03:00:50,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:50,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971227232] [2019-11-28 03:00:50,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:50,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:00:50,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813493328] [2019-11-28 03:00:50,653 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:50,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:50,654 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 03:00:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:50,705 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-11-28 03:00:50,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:50,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2019-11-28 03:00:50,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 03:00:50,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2019-11-28 03:00:50,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:00:50,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:00:50,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2019-11-28 03:00:50,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:50,715 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2019-11-28 03:00:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2019-11-28 03:00:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2019-11-28 03:00:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 03:00:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-28 03:00:50,725 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-28 03:00:50,725 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-28 03:00:50,725 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:00:50,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2019-11-28 03:00:50,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 03:00:50,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:50,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:50,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:00:50,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:50,727 INFO L794 eck$LassoCheckResult]: Stem: 638#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 631#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 632#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2019-11-28 03:00:50,727 INFO L796 eck$LassoCheckResult]: Loop: 612#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 620#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 629#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 633#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 641#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 607#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 608#L557-10 assume !test_fun_#t~short18; 615#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 625#L557-13 assume !test_fun_#t~short20; 626#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 636#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 639#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 611#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2019-11-28 03:00:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,729 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-11-28 03:00:50,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328043378] [2019-11-28 03:00:50,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,770 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:50,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash 624883089, now seen corresponding path program 1 times [2019-11-28 03:00:50,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911587205] [2019-11-28 03:00:50,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:50,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911587205] [2019-11-28 03:00:50,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:50,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:00:50,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853321803] [2019-11-28 03:00:50,797 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:50,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:00:50,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:00:50,799 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 03:00:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:50,833 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-28 03:00:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:50,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2019-11-28 03:00:50,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:50,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2019-11-28 03:00:50,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:00:50,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:00:50,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-11-28 03:00:50,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:50,837 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 03:00:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-11-28 03:00:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 03:00:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:00:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-11-28 03:00:50,841 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 03:00:50,841 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 03:00:50,841 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:00:50,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2019-11-28 03:00:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:50,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:50,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:50,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:00:50,846 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:50,846 INFO L794 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 734#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 735#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2019-11-28 03:00:50,846 INFO L796 eck$LassoCheckResult]: Loop: 719#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 724#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 732#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 736#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 743#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 714#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 715#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 722#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 727#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 729#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 738#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 741#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 718#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2019-11-28 03:00:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2019-11-28 03:00:50,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721873024] [2019-11-28 03:00:50,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:50,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2019-11-28 03:00:50,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:50,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133817372] [2019-11-28 03:00:50,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:51,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133817372] [2019-11-28 03:00:51,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:51,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:00:51,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070453654] [2019-11-28 03:00:51,003 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:51,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:51,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:00:51,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:00:51,004 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-28 03:00:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:51,235 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-28 03:00:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:00:51,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 98 transitions. [2019-11-28 03:00:51,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-28 03:00:51,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 75 states and 82 transitions. [2019-11-28 03:00:51,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-28 03:00:51,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-28 03:00:51,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 82 transitions. [2019-11-28 03:00:51,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:51,242 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-28 03:00:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 82 transitions. [2019-11-28 03:00:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2019-11-28 03:00:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 03:00:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-28 03:00:51,247 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 03:00:51,247 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 03:00:51,247 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:00:51,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2019-11-28 03:00:51,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 03:00:51,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:51,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:51,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:00:51,250 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:51,251 INFO L794 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 886#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 887#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2019-11-28 03:00:51,251 INFO L796 eck$LassoCheckResult]: Loop: 871#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 876#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 884#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 897#L557-6 assume !test_fun_#t~short13; 898#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 866#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 867#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 874#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 880#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 882#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 892#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 895#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 870#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2019-11-28 03:00:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2019-11-28 03:00:51,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:51,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944400760] [2019-11-28 03:00:51,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2019-11-28 03:00:51,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:51,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146723010] [2019-11-28 03:00:51,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:00:51,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146723010] [2019-11-28 03:00:51,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:00:51,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:00:51,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009383501] [2019-11-28 03:00:51,347 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:00:51,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:00:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:00:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:00:51,347 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 03:00:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:00:51,388 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-28 03:00:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:00:51,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2019-11-28 03:00:51,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:51,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2019-11-28 03:00:51,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:00:51,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:00:51,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2019-11-28 03:00:51,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:00:51,390 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 03:00:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2019-11-28 03:00:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 03:00:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:00:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 03:00:51,393 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 03:00:51,393 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 03:00:51,393 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:00:51,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2019-11-28 03:00:51,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 03:00:51,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:00:51,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:00:51,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:00:51,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:00:51,396 INFO L794 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 990#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 991#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2019-11-28 03:00:51,397 INFO L796 eck$LassoCheckResult]: Loop: 975#L557-1 assume !test_fun_#t~short9; 980#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 988#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 992#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 998#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 970#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 971#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 978#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 983#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 985#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 993#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem11;havoc test_fun_#t~mem16;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem12;havoc test_fun_#t~mem15;havoc test_fun_#t~mem7;havoc test_fun_#t~mem17;havoc test_fun_#t~short13;havoc test_fun_#t~mem6;havoc test_fun_#t~short14;havoc test_fun_#t~short20;havoc test_fun_#t~short22;havoc test_fun_#t~short18;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 974#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2019-11-28 03:00:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2019-11-28 03:00:51,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:51,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883076880] [2019-11-28 03:00:51,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2019-11-28 03:00:51,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:51,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087312880] [2019-11-28 03:00:51,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2019-11-28 03:00:51,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:00:51,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120941189] [2019-11-28 03:00:51,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:00:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:00:51,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:00:51,936 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2019-11-28 03:00:52,319 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-28 03:00:52,886 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2019-11-28 03:00:53,573 WARN L192 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-28 03:00:53,578 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:00:53,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:00:53,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:00:53,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:00:53,578 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:00:53,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:53,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:00:53,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:00:53,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration8_Lasso [2019-11-28 03:00:53,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:00:53,579 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:00:53,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:53,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:54,966 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2019-11-28 03:00:55,595 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-11-28 03:00:55,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:00:55,809 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-28 03:00:56,071 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-28 03:00:56,568 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-28 03:00:56,755 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-28 03:00:57,032 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:00:57,032 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:57,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:57,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:57,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:00:57,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:57,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:57,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:57,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:00:57,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:00:57,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:57,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:57,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:57,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:00:57,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:00:57,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:57,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:00:57,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:00:57,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:57,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:00:57,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:00:57,076 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:00:57,076 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:00:57,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:00:57,118 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-28 03:00:57,118 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:00:57,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:00:57,253 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:00:57,253 INFO L444 ModelExtractionUtils]: 60 out of 76 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:00:57,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:00:57,261 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-28 03:00:57,261 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:00:57,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2019-11-28 03:00:57,502 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-28 03:00:57,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:00:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:00:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:57,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:00:57,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:00:57,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:00:57,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:00:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:57,688 INFO L343 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2019-11-28 03:00:57,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 109 [2019-11-28 03:00:57,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:57,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:00:57,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:57,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:00:57,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:57,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:00:57,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:00:57,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:57,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:00:57,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:00:57,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:00:57,726 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.constructTraceCheck(RefineBuchi.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:208) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 03:00:57,730 INFO L168 Benchmark]: Toolchain (without parser) took 14087.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:57,730 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:57,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:57,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:57,732 INFO L168 Benchmark]: Boogie Preprocessor took 25.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:00:57,733 INFO L168 Benchmark]: RCFGBuilder took 529.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:57,733 INFO L168 Benchmark]: BuchiAutomizer took 12872.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.2 MB). Peak memory consumption was 191.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:00:57,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 583.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 529.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12872.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.2 MB). Peak memory consumption was 191.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...