./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/b.11-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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:39:01,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:39:01,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:39:01,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:39:01,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:39:01,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:39:01,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:39:01,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:39:01,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:39:01,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:39:01,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:39:01,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:39:01,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:39:01,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:39:01,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:39:01,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:39:01,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:39:01,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:39:01,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:39:01,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:39:01,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:39:01,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:39:01,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:39:01,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:39:01,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:39:02,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:39:02,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:39:02,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:39:02,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:39:02,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:39:02,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:39:02,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:39:02,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:39:02,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:39:02,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:39:02,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:39:02,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:39:02,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:39:02,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:39:02,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:39:02,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:39:02,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:39:02,064 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:39:02,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:39:02,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:39:02,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:39:02,067 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:39:02,067 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:39:02,067 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:39:02,068 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:39:02,068 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:39:02,068 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:39:02,069 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:39:02,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:39:02,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:39:02,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:39:02,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:39:02,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:39:02,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:39:02,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:39:02,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:39:02,071 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:39:02,072 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:39:02,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:39:02,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:39:02,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:39:02,073 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:39:02,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:39:02,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:39:02,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:39:02,074 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:39:02,075 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:39:02,075 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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2020-10-20 06:39:02,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:39:02,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:39:02,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:39:02,320 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:39:02,320 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:39:02,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2020-10-20 06:39:02,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920b9340/bba5c431745943b6a4a236659064ad8b/FLAG68c7b4544 [2020-10-20 06:39:02,863 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:39:02,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2020-10-20 06:39:02,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920b9340/bba5c431745943b6a4a236659064ad8b/FLAG68c7b4544 [2020-10-20 06:39:03,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920b9340/bba5c431745943b6a4a236659064ad8b [2020-10-20 06:39:03,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:39:03,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:39:03,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:03,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:39:03,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:39:03,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394fd25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03, skipping insertion in model container [2020-10-20 06:39:03,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:39:03,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:39:03,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:03,752 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:39:03,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:03,864 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:39:03,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03 WrapperNode [2020-10-20 06:39:03,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:03,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:03,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:39:03,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:39:03,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:03,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:39:03,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:39:03,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:39:03,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (1/1) ... [2020-10-20 06:39:03,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:39:03,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:39:03,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:39:03,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:39:03,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (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 [2020-10-20 06:39:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:39:04,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:39:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:39:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:39:04,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:39:04,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:39:04,304 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:39:04,305 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:39:04,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:04 BoogieIcfgContainer [2020-10-20 06:39:04,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:39:04,307 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:39:04,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:39:04,311 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:39:04,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:04,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:39:03" (1/3) ... [2020-10-20 06:39:04,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c592318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:04, skipping insertion in model container [2020-10-20 06:39:04,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:04,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:03" (2/3) ... [2020-10-20 06:39:04,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c592318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:04, skipping insertion in model container [2020-10-20 06:39:04,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:04,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:04" (3/3) ... [2020-10-20 06:39:04,316 INFO L373 chiAutomizerObserver]: Analyzing ICFG b.11-alloca.i [2020-10-20 06:39:04,374 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:39:04,374 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:39:04,374 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:39:04,374 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:39:04,375 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:39:04,375 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:39:04,375 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:39:04,375 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:39:04,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:39:04,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:04,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:04,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:04,436 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:04,436 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:04,436 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:39:04,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 06:39:04,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:04,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:04,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:04,439 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:04,439 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:04,448 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2020-10-20 06:39:04,448 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2020-10-20 06:39:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:39:04,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:04,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133750532] [2020-10-20 06:39:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:04,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:04,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:04,646 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2020-10-20 06:39:04,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:04,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444214781] [2020-10-20 06:39:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:04,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444214781] [2020-10-20 06:39:04,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:04,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:39:04,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637953971] [2020-10-20 06:39:04,814 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:04,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:39:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:39:04,834 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2020-10-20 06:39:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:04,938 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-10-20 06:39:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:39:04,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-20 06:39:04,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 06:39:04,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2020-10-20 06:39:04,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:39:04,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 06:39:04,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-10-20 06:39:04,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:04,958 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:39:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-10-20 06:39:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-20 06:39:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:39:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-10-20 06:39:04,989 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 06:39:04,989 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-10-20 06:39:04,990 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:39:04,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-10-20 06:39:04,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:39:04,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:04,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:04,992 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:04,992 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:04,993 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 61#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2020-10-20 06:39:04,993 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := 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);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 53#L559-2 [2020-10-20 06:39:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:39:04,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:04,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124792553] [2020-10-20 06:39:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:05,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:05,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:05,042 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2020-10-20 06:39:05,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:05,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287627669] [2020-10-20 06:39:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:05,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:05,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:05,100 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2020-10-20 06:39:05,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:05,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29413062] [2020-10-20 06:39:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:05,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:05,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:05,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:05,445 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2020-10-20 06:39:05,861 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-10-20 06:39:06,010 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-20 06:39:06,024 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:06,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:06,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:06,025 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:06,025 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:06,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:06,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:06,026 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:06,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration2_Lasso [2020-10-20 06:39:06,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:06,026 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:06,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,396 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-20 06:39:06,519 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-20 06:39:06,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:06,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:07,178 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:07,185 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) [2020-10-20 06:39:07,197 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 [2020-10-20 06:39:07,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:07,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:07,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:07,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:07,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:07,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:07,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:07,207 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) [2020-10-20 06:39:07,247 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 [2020-10-20 06:39:07,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:07,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:07,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:07,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:07,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:07,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:07,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:07,339 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:39:07,339 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. 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) [2020-10-20 06:39:07,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:07,348 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:39:07,348 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:07,349 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-10-20 06:39:07,470 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-10-20 06:39:07,478 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:07,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:07,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:07,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:39:07,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:07,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:07,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:07,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:39:07,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-20 06:39:07,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 31 states and 45 transitions. Complement of second has 8 states. [2020-10-20 06:39:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:39:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-10-20 06:39:07,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-20 06:39:07,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:07,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2020-10-20 06:39:07,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:07,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2020-10-20 06:39:07,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:07,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2020-10-20 06:39:07,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:39:07,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2020-10-20 06:39:07,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:39:07,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:39:07,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2020-10-20 06:39:07,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:07,912 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-10-20 06:39:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2020-10-20 06:39:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-10-20 06:39:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 06:39:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-10-20 06:39:07,917 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-20 06:39:07,917 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-20 06:39:07,917 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:39:07,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2020-10-20 06:39:07,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:39:07,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:07,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:07,921 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:39:07,922 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:07,925 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 256#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 257#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2020-10-20 06:39:07,925 INFO L796 eck$LassoCheckResult]: Loop: 240#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 254#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 259#L555-4 assume test_fun_#t~short13; 243#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 244#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := 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);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 251#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 246#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 247#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 239#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 240#L555-1 [2020-10-20 06:39:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-20 06:39:07,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:07,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517457511] [2020-10-20 06:39:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:07,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:07,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:08,005 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2020-10-20 06:39:08,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:08,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279749267] [2020-10-20 06:39:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:08,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:08,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:08,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:08,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash -198955769, now seen corresponding path program 1 times [2020-10-20 06:39:08,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:08,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910210015] [2020-10-20 06:39:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:08,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:08,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:08,072 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:08,326 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2020-10-20 06:39:08,812 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2020-10-20 06:39:09,017 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-20 06:39:09,021 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:09,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:09,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:09,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:09,022 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:09,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:09,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:09,023 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:09,023 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration3_Lasso [2020-10-20 06:39:09,023 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:09,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:09,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,825 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2020-10-20 06:39:09,981 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-10-20 06:39:09,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:09,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:10,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:10,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:10,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:10,782 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-10-20 06:39:10,916 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-10-20 06:39:10,965 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:10,966 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:10,971 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 [2020-10-20 06:39:10,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:10,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:10,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:10,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:10,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:10,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:10,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:10,978 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) [2020-10-20 06:39:11,000 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 [2020-10-20 06:39:11,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,004 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 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 [2020-10-20 06:39:11,026 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 [2020-10-20 06:39:11,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,030 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,052 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 [2020-10-20 06:39:11,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,059 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) [2020-10-20 06:39:11,083 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,086 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,109 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 [2020-10-20 06:39:11,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,112 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,134 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 [2020-10-20 06:39:11,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,143 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,175 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 [2020-10-20 06:39:11,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,184 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,221 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 [2020-10-20 06:39:11,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,233 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,256 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 [2020-10-20 06:39:11,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,260 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,282 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 [2020-10-20 06:39:11,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,285 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,309 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 [2020-10-20 06:39:11,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,314 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 [2020-10-20 06:39:11,340 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 [2020-10-20 06:39:11,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,347 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 [2020-10-20 06:39:11,373 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 [2020-10-20 06:39:11,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,380 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 [2020-10-20 06:39:11,401 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 [2020-10-20 06:39:11,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,406 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,440 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 [2020-10-20 06:39:11,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,444 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 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 [2020-10-20 06:39:11,468 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 [2020-10-20 06:39:11,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,471 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 [2020-10-20 06:39:11,496 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 [2020-10-20 06:39:11,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,502 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 [2020-10-20 06:39:11,546 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 [2020-10-20 06:39:11,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,551 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 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 [2020-10-20 06:39:11,573 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 [2020-10-20 06:39:11,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:11,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:11,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:11,577 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,598 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 [2020-10-20 06:39:11,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,621 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,643 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 [2020-10-20 06:39:11,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,651 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,677 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 [2020-10-20 06:39:11,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,688 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 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,711 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 [2020-10-20 06:39:11,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,718 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,740 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 [2020-10-20 06:39:11,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,747 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,773 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 [2020-10-20 06:39:11,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,781 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,808 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 [2020-10-20 06:39:11,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:11,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:11,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:11,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:11,817 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,840 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 [2020-10-20 06:39:11,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:11,842 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 06:39:11,842 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:39:11,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:11,863 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-20 06:39:11,863 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:39:11,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:11,977 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 06:39:11,977 INFO L444 ModelExtractionUtils]: 40 out of 56 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:11,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:39:11,982 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-20 06:39:11,983 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:11,983 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-10-20 06:39:12,068 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-10-20 06:39:12,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:12,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:12,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:12,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:39:12,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:12,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:12,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:12,345 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:12,345 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2020-10-20 06:39:12,349 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:39:12,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:12,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:12,387 INFO L625 ElimStorePlain]: treesize reduction 130, result has 21.7 percent of original size [2020-10-20 06:39:12,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:39:12,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2020-10-20 06:39:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:12,416 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 [2020-10-20 06:39:12,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-10-20 06:39:12,572 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 64 states and 97 transitions. Complement of second has 10 states. [2020-10-20 06:39:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 06:39:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-10-20 06:39:12,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2020-10-20 06:39:12,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:12,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2020-10-20 06:39:12,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:12,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2020-10-20 06:39:12,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:12,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. [2020-10-20 06:39:12,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:39:12,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2020-10-20 06:39:12,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 06:39:12,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 06:39:12,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2020-10-20 06:39:12,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:12,581 INFO L691 BuchiCegarLoop]: Abstraction has 64 states and 97 transitions. [2020-10-20 06:39:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2020-10-20 06:39:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2020-10-20 06:39:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 06:39:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2020-10-20 06:39:12,587 INFO L714 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2020-10-20 06:39:12,587 INFO L594 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2020-10-20 06:39:12,587 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:39:12,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2020-10-20 06:39:12,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:39:12,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:12,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:12,589 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:12,589 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:12,590 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 501#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 502#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 540#L555-1 assume !test_fun_#t~short8; 504#L555-3 [2020-10-20 06:39:12,590 INFO L796 eck$LassoCheckResult]: Loop: 504#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 505#L555-4 assume test_fun_#t~short13; 507#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 495#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := 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);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 496#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 490#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 491#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 483#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 484#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 504#L555-3 [2020-10-20 06:39:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-20 06:39:12,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72532231] [2020-10-20 06:39:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,615 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 1 times [2020-10-20 06:39:12,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987769922] [2020-10-20 06:39:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:12,649 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2029276831, now seen corresponding path program 1 times [2020-10-20 06:39:12,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387492599] [2020-10-20 06:39:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:12,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387492599] [2020-10-20 06:39:12,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:12,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:39:12,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053010946] [2020-10-20 06:39:12,879 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2020-10-20 06:39:12,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:12,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:39:12,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:39:12,939 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand 4 states. [2020-10-20 06:39:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:12,971 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-10-20 06:39:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:12,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2020-10-20 06:39:12,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-10-20 06:39:12,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 130 transitions. [2020-10-20 06:39:12,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-10-20 06:39:12,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-10-20 06:39:12,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-10-20 06:39:12,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:12,976 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-10-20 06:39:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-10-20 06:39:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2020-10-20 06:39:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 06:39:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2020-10-20 06:39:12,983 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2020-10-20 06:39:12,983 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2020-10-20 06:39:12,983 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:39:12,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2020-10-20 06:39:12,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-20 06:39:12,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:12,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:12,985 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:12,985 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:12,985 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 666#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 667#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 698#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 669#L555-3 [2020-10-20 06:39:12,985 INFO L796 eck$LassoCheckResult]: Loop: 669#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 670#L555-4 assume test_fun_#t~short13; 650#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 651#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := 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);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 657#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 653#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 654#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 646#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 647#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 669#L555-3 [2020-10-20 06:39:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-10-20 06:39:12,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:12,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831379440] [2020-10-20 06:39:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:12,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:13,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:13,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 2 times [2020-10-20 06:39:13,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:13,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616059220] [2020-10-20 06:39:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:13,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:13,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:13,034 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1872663455, now seen corresponding path program 1 times [2020-10-20 06:39:13,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:13,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534065496] [2020-10-20 06:39:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:13,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:13,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:13,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:13,268 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2020-10-20 06:39:13,733 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2020-10-20 06:39:13,902 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-20 06:39:13,905 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:13,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:13,906 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:13,906 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:13,906 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:13,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:13,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:13,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:13,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration5_Lasso [2020-10-20 06:39:13,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:13,907 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:13,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,778 WARN L193 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2020-10-20 06:39:14,962 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-10-20 06:39:14,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:14,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:15,202 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-20 06:39:15,753 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-20 06:39:15,965 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-10-20 06:39:16,098 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:16,102 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:16,112 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 [2020-10-20 06:39:16,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:16,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:16,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:16,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:16,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:16,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:16,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 34 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:16,147 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 [2020-10-20 06:39:16,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:16,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:16,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:16,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:16,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:16,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:16,155 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:16,176 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 [2020-10-20 06:39:16,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:16,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:16,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:16,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:16,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:16,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:16,185 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:16,207 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 [2020-10-20 06:39:16,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:16,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:16,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:16,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:16,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:16,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:16,213 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:16,236 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 [2020-10-20 06:39:16,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:16,238 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 06:39:16,238 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:39:16,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:16,268 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-20 06:39:16,268 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:39:16,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:16,426 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:39:16,426 INFO L444 ModelExtractionUtils]: 58 out of 66 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:16,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:16,449 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-20 06:39:16,449 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:16,449 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2020-10-20 06:39:16,557 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-10-20 06:39:16,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:16,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:16,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:16,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:39:16,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:16,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:16,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:16,703 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:16,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2020-10-20 06:39:16,707 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:39:16,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:16,711 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:16,761 INFO L625 ElimStorePlain]: treesize reduction 130, result has 21.7 percent of original size [2020-10-20 06:39:16,763 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:39:16,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2020-10-20 06:39:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:16,791 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 [2020-10-20 06:39:16,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 7 states. [2020-10-20 06:39:16,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 204 states and 297 transitions. Complement of second has 10 states. [2020-10-20 06:39:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 06:39:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-10-20 06:39:16,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2020-10-20 06:39:16,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:16,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2020-10-20 06:39:16,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:16,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2020-10-20 06:39:16,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:16,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. [2020-10-20 06:39:16,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:16,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2020-10-20 06:39:16,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:39:16,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 06:39:16,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2020-10-20 06:39:16,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:16,932 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-10-20 06:39:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2020-10-20 06:39:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-20 06:39:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 06:39:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2020-10-20 06:39:16,936 INFO L714 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-10-20 06:39:16,936 INFO L594 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-10-20 06:39:16,936 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:39:16,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2020-10-20 06:39:16,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:16,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:16,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:16,938 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:16,938 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:16,938 INFO L794 eck$LassoCheckResult]: Stem: 1105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1103#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1104#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1132#L555-1 assume !test_fun_#t~short8; 1106#L555-3 [2020-10-20 06:39:16,938 INFO L796 eck$LassoCheckResult]: Loop: 1106#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1107#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1110#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1080#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1081#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1088#L555-10 assume !test_fun_#t~short16; 1095#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1090#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1091#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1084#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1085#L555-1 assume !test_fun_#t~short8; 1106#L555-3 [2020-10-20 06:39:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-20 06:39:16,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:16,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610122554] [2020-10-20 06:39:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:16,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:16,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:16,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1675651104, now seen corresponding path program 1 times [2020-10-20 06:39:16,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:16,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426532829] [2020-10-20 06:39:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:16,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426532829] [2020-10-20 06:39:16,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:16,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:39:16,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593074142] [2020-10-20 06:39:16,975 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:16,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:39:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:39:16,975 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-10-20 06:39:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:16,985 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-10-20 06:39:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:39:16,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2020-10-20 06:39:16,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:16,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2020-10-20 06:39:16,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:39:16,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 06:39:16,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2020-10-20 06:39:16,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:16,988 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-10-20 06:39:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2020-10-20 06:39:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-20 06:39:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 06:39:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-10-20 06:39:16,992 INFO L714 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-10-20 06:39:16,992 INFO L594 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-10-20 06:39:16,992 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:39:16,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2020-10-20 06:39:16,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:16,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:16,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:16,993 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:16,993 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:16,993 INFO L794 eck$LassoCheckResult]: Stem: 1223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1222#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1202#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1203#L555-1 assume !test_fun_#t~short8; 1224#L555-3 [2020-10-20 06:39:16,994 INFO L796 eck$LassoCheckResult]: Loop: 1224#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1225#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1228#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1198#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1199#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1207#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := 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);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1214#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1209#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1210#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1231#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1234#L555-1 assume !test_fun_#t~short8; 1224#L555-3 [2020-10-20 06:39:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:16,994 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2020-10-20 06:39:16,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:16,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021689788] [2020-10-20 06:39:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:17,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:17,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:17,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1732909406, now seen corresponding path program 1 times [2020-10-20 06:39:17,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:17,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552839532] [2020-10-20 06:39:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:17,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552839532] [2020-10-20 06:39:17,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:17,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 06:39:17,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080093860] [2020-10-20 06:39:17,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:17,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:17,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:39:17,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:39:17,088 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand 7 states. [2020-10-20 06:39:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:17,196 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2020-10-20 06:39:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:39:17,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2020-10-20 06:39:17,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:17,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 86 transitions. [2020-10-20 06:39:17,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:39:17,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 06:39:17,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2020-10-20 06:39:17,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:17,199 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-10-20 06:39:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2020-10-20 06:39:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-20 06:39:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 06:39:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2020-10-20 06:39:17,204 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-10-20 06:39:17,204 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-10-20 06:39:17,204 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:39:17,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2020-10-20 06:39:17,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-20 06:39:17,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:17,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:17,206 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:17,206 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:17,206 INFO L794 eck$LassoCheckResult]: Stem: 1367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1365#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;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~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1366#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1402#L555-1 assume !test_fun_#t~short8; 1368#L555-3 [2020-10-20 06:39:17,206 INFO L796 eck$LassoCheckResult]: Loop: 1368#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1369#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1371#L555-6 assume !test_fun_#t~short12; 1346#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1347#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1354#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := 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);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1360#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~short8;havoc test_fun_#t~mem14;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short16;havoc test_fun_#t~mem10;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1356#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem17;havoc test_fun_#t~mem18;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1357#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1350#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1351#L555-1 assume !test_fun_#t~short8; 1368#L555-3 [2020-10-20 06:39:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2020-10-20 06:39:17,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:17,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116855202] [2020-10-20 06:39:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:17,215 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:17,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:17,225 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1052851036, now seen corresponding path program 1 times [2020-10-20 06:39:17,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:17,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071705370] [2020-10-20 06:39:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:17,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071705370] [2020-10-20 06:39:17,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:17,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:39:17,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040131274] [2020-10-20 06:39:17,246 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:17,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:17,247 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 19 Second operand 5 states. [2020-10-20 06:39:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:17,282 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-10-20 06:39:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:17,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2020-10-20 06:39:17,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:39:17,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2020-10-20 06:39:17,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:39:17,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:39:17,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:39:17,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:17,284 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:17,284 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:17,284 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:17,284 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:39:17,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:39:17,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:39:17,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:39:17,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:39:17 BoogieIcfgContainer [2020-10-20 06:39:17,291 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:39:17,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:39:17,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:39:17,292 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:39:17,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:04" (3/4) ... [2020-10-20 06:39:17,296 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:39:17,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:39:17,297 INFO L168 Benchmark]: Toolchain (without parser) took 14021.36 ms. Allocated memory was 38.3 MB in the beginning and 123.2 MB in the end (delta: 84.9 MB). Free memory was 20.4 MB in the beginning and 64.3 MB in the end (delta: -44.0 MB). Peak memory consumption was 40.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:17,298 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 35.1 MB. Free memory is still 12.4 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:39:17,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.07 ms. Allocated memory was 38.3 MB in the beginning and 46.1 MB in the end (delta: 7.9 MB). Free memory was 19.4 MB in the beginning and 17.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:17,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.89 ms. Allocated memory was 46.1 MB in the beginning and 47.2 MB in the end (delta: 1.0 MB). Free memory was 17.6 MB in the beginning and 29.8 MB in the end (delta: -12.2 MB). Peak memory consumption was 4.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:17,300 INFO L168 Benchmark]: Boogie Preprocessor took 28.51 ms. Allocated memory is still 47.2 MB. Free memory was 29.8 MB in the beginning and 28.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:17,300 INFO L168 Benchmark]: RCFGBuilder took 360.85 ms. Allocated memory was 47.2 MB in the beginning and 47.7 MB in the end (delta: 524.3 kB). Free memory was 28.0 MB in the beginning and 26.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:17,301 INFO L168 Benchmark]: BuchiAutomizer took 12983.94 ms. Allocated memory was 47.7 MB in the beginning and 123.2 MB in the end (delta: 75.5 MB). Free memory was 26.0 MB in the beginning and 64.3 MB in the end (delta: -38.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:17,301 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 123.2 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:39:17,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58 ms. Allocated memory is still 35.1 MB. Free memory is still 12.4 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 583.07 ms. Allocated memory was 38.3 MB in the beginning and 46.1 MB in the end (delta: 7.9 MB). Free memory was 19.4 MB in the beginning and 17.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 50.89 ms. Allocated memory was 46.1 MB in the beginning and 47.2 MB in the end (delta: 1.0 MB). Free memory was 17.6 MB in the beginning and 29.8 MB in the end (delta: -12.2 MB). Peak memory consumption was 4.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.51 ms. Allocated memory is still 47.2 MB. Free memory was 29.8 MB in the beginning and 28.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 360.85 ms. Allocated memory was 47.2 MB in the beginning and 47.7 MB in the end (delta: 524.3 kB). Free memory was 28.0 MB in the beginning and 26.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 12983.94 ms. Allocated memory was 47.7 MB in the beginning and 123.2 MB in the end (delta: 75.5 MB). Free memory was 26.0 MB in the beginning and 64.3 MB in the end (delta: -38.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 14.3 GB. * Witness Printer took 4.29 ms. Allocated memory is still 123.2 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 14.3 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 11.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 82 SDslu, 179 SDs, 0 SdLazy, 214 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital318 mio100 ax105 hnf99 lsp94 ukn80 mio100 lsp30 div100 bol107 ite100 ukn100 eq162 hnf90 smp92 dnf263 smp65 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 144ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...