./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.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 0c73140129db08253eb2666e014a272764010e16 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:03,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:03,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:03,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:03,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:03,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:03,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:03,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:03,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:03,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:03,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:03,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:03,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:03,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:03,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:03,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:03,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:03,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:03,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:03,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:03,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:03,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:03,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:03,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:03,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:03,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:03,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:03,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:03,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:03,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:03,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:03,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:03,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:03,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:03,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:03,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:03,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:03,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:03,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:03,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:03,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:03,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:03,531 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:03,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:03,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:03,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:03,537 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:03,538 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:03,538 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:03,538 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:03,538 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:03,539 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:03,540 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:03,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:03,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:03,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:03,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:03,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:03,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:03,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:03,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:03,544 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:03,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:03,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:03,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:03,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:03,546 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:03,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:03,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:03,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:03,547 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:03,548 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:03,548 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 -> 0c73140129db08253eb2666e014a272764010e16 [2019-11-28 20:34:03,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:03,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:03,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:03,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:03,897 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:03,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2019-11-28 20:34:03,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122f55803/2db91cd798734364a47f9f7abea0b57a/FLAG32021d52f [2019-11-28 20:34:04,433 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:04,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/diff-alloca-1.i [2019-11-28 20:34:04,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122f55803/2db91cd798734364a47f9f7abea0b57a/FLAG32021d52f [2019-11-28 20:34:04,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122f55803/2db91cd798734364a47f9f7abea0b57a [2019-11-28 20:34:04,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:04,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:04,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:04,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:04,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:04,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:04" (1/1) ... [2019-11-28 20:34:04,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3298c3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:04, skipping insertion in model container [2019-11-28 20:34:04,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:04" (1/1) ... [2019-11-28 20:34:04,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:04,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:05,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:05,289 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:05,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:05,410 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:05,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05 WrapperNode [2019-11-28 20:34:05,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:05,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:05,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:05,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:05,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:05,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:05,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:05,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:05,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... [2019-11-28 20:34:05,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:05,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:05,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:05,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:05,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:05,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:05,908 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:05,908 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:34:05,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:05 BoogieIcfgContainer [2019-11-28 20:34:05,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:05,911 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:05,911 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:05,914 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:05,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:05,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:04" (1/3) ... [2019-11-28 20:34:05,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69904282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:05, skipping insertion in model container [2019-11-28 20:34:05,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:05,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:05" (2/3) ... [2019-11-28 20:34:05,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69904282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:05, skipping insertion in model container [2019-11-28 20:34:05,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:05,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:05" (3/3) ... [2019-11-28 20:34:05,919 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-1.i [2019-11-28 20:34:05,959 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:05,959 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:05,959 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:05,959 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:05,960 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:05,960 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:05,960 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:05,961 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:05,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:34:05,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:05,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:05,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:05,998 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:05,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:05,999 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:05,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:34:06,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:06,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:06,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:06,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:06,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:06,007 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2019-11-28 20:34:06,008 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2019-11-28 20:34:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 20:34:06,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292730060] [2019-11-28 20:34:06,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2019-11-28 20:34:06,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971916976] [2019-11-28 20:34:06,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:06,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971916976] [2019-11-28 20:34:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:06,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917532952] [2019-11-28 20:34:06,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:06,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:34:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:34:06,249 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-28 20:34:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:06,256 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-28 20:34:06,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:34:06,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-28 20:34:06,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:06,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2019-11-28 20:34:06,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:34:06,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:34:06,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2019-11-28 20:34:06,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:06,265 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 20:34:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2019-11-28 20:34:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:34:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:34:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-11-28 20:34:06,291 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 20:34:06,291 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 20:34:06,291 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:34:06,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-11-28 20:34:06,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:06,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:06,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:06,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:06,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:06,293 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2019-11-28 20:34:06,294 INFO L796 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2019-11-28 20:34:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-28 20:34:06,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440565434] [2019-11-28 20:34:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2019-11-28 20:34:06,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710724502] [2019-11-28 20:34:06,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2019-11-28 20:34:06,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994174744] [2019-11-28 20:34:06,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:06,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994174744] [2019-11-28 20:34:06,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:06,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:34:06,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308633288] [2019-11-28 20:34:06,600 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-28 20:34:06,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:34:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:34:06,653 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-28 20:34:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:06,728 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2019-11-28 20:34:06,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:34:06,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2019-11-28 20:34:06,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:06,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2019-11-28 20:34:06,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 20:34:06,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 20:34:06,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2019-11-28 20:34:06,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:06,734 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-11-28 20:34:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2019-11-28 20:34:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-28 20:34:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:34:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 20:34:06,737 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 20:34:06,738 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 20:34:06,738 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:34:06,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-28 20:34:06,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:06,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:06,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:06,739 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:06,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:34:06,740 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 72#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 78#L554-2 [2019-11-28 20:34:06,740 INFO L796 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2019-11-28 20:34:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2019-11-28 20:34:06,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278199668] [2019-11-28 20:34:06,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,772 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2019-11-28 20:34:06,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635846034] [2019-11-28 20:34:06,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:06,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635846034] [2019-11-28 20:34:06,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:06,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:34:06,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227416494] [2019-11-28 20:34:06,818 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:06,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:34:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:34:06,819 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 20:34:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:06,860 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-11-28 20:34:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:34:06,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-28 20:34:06,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:34:06,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-11-28 20:34:06,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 20:34:06,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 20:34:06,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-28 20:34:06,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:06,865 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 20:34:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-28 20:34:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-11-28 20:34:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:34:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-28 20:34:06,869 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-28 20:34:06,870 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-28 20:34:06,870 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:34:06,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-28 20:34:06,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 20:34:06,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:06,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:06,874 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:06,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:34:06,877 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 107#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 114#L554-2 [2019-11-28 20:34:06,877 INFO L796 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2019-11-28 20:34:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2019-11-28 20:34:06,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208184887] [2019-11-28 20:34:06,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2019-11-28 20:34:06,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992462790] [2019-11-28 20:34:06,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:06,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:06,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:06,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2019-11-28 20:34:06,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:06,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886380490] [2019-11-28 20:34:06,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:07,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:07,122 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 20:34:07,655 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-28 20:34:07,874 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-28 20:34:07,888 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:07,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:07,889 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:07,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:07,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:07,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:07,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:07,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:07,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration4_Lasso [2019-11-28 20:34:07,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:07,891 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:07,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,407 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-11-28 20:34:08,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:08,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:09,137 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:09,142 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:09,173 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:09,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:09,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,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 [2019-11-28 20:34:09,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,296 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 [2019-11-28 20:34:09,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 [2019-11-28 20:34:09,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:09,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 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 [2019-11-28 20:34:09,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:09,334 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:09,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,373 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 [2019-11-28 20:34:09,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:09,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,518 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 [2019-11-28 20:34:09,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:09,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,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 [2019-11-28 20:34:09,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:09,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:09,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,581 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) [2019-11-28 20:34:09,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 [2019-11-28 20:34:09,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,631 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) [2019-11-28 20:34:09,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,662 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) [2019-11-28 20:34:09,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:09,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:09,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:09,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:09,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:09,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:09,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:09,876 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:34:09,876 INFO L444 ModelExtractionUtils]: 26 out of 40 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:09,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:09,913 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:34:09,913 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:09,914 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [1*ULTIMATE.start_diff_~A.offset >= 0] [2019-11-28 20:34:09,996 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 20:34:10,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:10,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:34:10,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:10,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:34:10,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:10,131 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:34:10,132 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 20:34:10,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2019-11-28 20:34:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 20:34:10,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:34:10,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:10,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-28 20:34:10,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:10,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2019-11-28 20:34:10,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:10,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-11-28 20:34:10,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:34:10,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2019-11-28 20:34:10,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:10,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:34:10,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-28 20:34:10,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:10,227 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 20:34:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-28 20:34:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 20:34:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:34:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-11-28 20:34:10,235 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-28 20:34:10,235 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-11-28 20:34:10,235 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:34:10,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-11-28 20:34:10,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:34:10,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:10,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:10,236 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:34:10,236 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:34:10,238 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 266#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 267#L574 assume !(main_~Alen~0 < 1); 268#L574-2 assume !(main_~Blen~0 < 1); 280#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 277#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 270#L558-2 [2019-11-28 20:34:10,239 INFO L796 eck$LassoCheckResult]: Loop: 270#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 269#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 270#L558-2 [2019-11-28 20:34:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2019-11-28 20:34:10,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:10,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502124893] [2019-11-28 20:34:10,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:10,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-11-28 20:34:10,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:10,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396117291] [2019-11-28 20:34:10,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:10,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2019-11-28 20:34:10,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:10,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869561236] [2019-11-28 20:34:10,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:10,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:10,834 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 110 [2019-11-28 20:34:11,070 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-28 20:34:11,074 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:11,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:11,075 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:11,075 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:11,075 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:11,075 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:11,075 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:11,075 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:11,075 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration5_Lasso [2019-11-28 20:34:11,076 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:11,076 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:11,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,500 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-11-28 20:34:11,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:11,769 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 20:34:12,142 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 20:34:12,310 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:12,311 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:12,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:12,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:12,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:12,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:12,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:12,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:12,365 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) [2019-11-28 20:34:12,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:12,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:12,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,379 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) [2019-11-28 20:34:12,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:12,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:12,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,389 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) [2019-11-28 20:34:12,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:12,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,403 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) [2019-11-28 20:34:12,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:12,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:12,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,414 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) [2019-11-28 20:34:12,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:12,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:12,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,425 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) [2019-11-28 20:34:12,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:12,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,445 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) [2019-11-28 20:34:12,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:12,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:12,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:12,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:12,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:12,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:12,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,518 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:12,653 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-28 20:34:12,654 INFO L444 ModelExtractionUtils]: 48 out of 73 variables were initially zero. Simplification set additionally 20 variables to zero. 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) [2019-11-28 20:34:12,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:12,664 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:34:12,664 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:12,664 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -2*ULTIMATE.start_diff_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 Supporting invariants [-2*ULTIMATE.start_diff_~l2~0 + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 >= 0] [2019-11-28 20:34:12,741 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 20:34:12,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:12,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:34:12,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:12,866 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_80|], 4=[|v_#valid_110|]} [2019-11-28 20:34:12,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:12,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:12,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:12,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2019-11-28 20:34:12,903 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:12,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:12,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:12,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 20:34:12,953 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:12,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:12,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:34:12,990 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:63 [2019-11-28 20:34:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:13,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:34:13,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:13,087 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 20:34:13,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 20:34:13,215 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 38 states and 53 transitions. Complement of second has 9 states. [2019-11-28 20:34:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:34:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-28 20:34:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 20:34:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-28 20:34:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:34:13,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:13,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-28 20:34:13,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:34:13,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2019-11-28 20:34:13,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:13,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:34:13,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2019-11-28 20:34:13,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:13,224 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-11-28 20:34:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2019-11-28 20:34:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-11-28 20:34:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:34:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-28 20:34:13,227 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 20:34:13,227 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 20:34:13,227 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:34:13,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-28 20:34:13,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:34:13,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:13,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:13,229 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:13,229 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:34:13,229 INFO L794 eck$LassoCheckResult]: Stem: 451#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 444#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 445#L574 assume !(main_~Alen~0 < 1); 446#L574-2 assume !(main_~Blen~0 < 1); 457#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 454#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 455#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 449#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 450#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 459#L557-2 assume !(0 == diff_~found~0); 452#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 453#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 448#L558-2 [2019-11-28 20:34:13,229 INFO L796 eck$LassoCheckResult]: Loop: 448#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 447#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 448#L558-2 [2019-11-28 20:34:13,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2019-11-28 20:34:13,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:13,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364619655] [2019-11-28 20:34:13,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:13,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-11-28 20:34:13,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:13,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641844913] [2019-11-28 20:34:13,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:13,273 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2019-11-28 20:34:13,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:13,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928751481] [2019-11-28 20:34:13,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:13,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:14,037 WARN L192 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 133 [2019-11-28 20:34:14,229 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-28 20:34:14,231 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:14,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:14,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:14,231 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:14,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:14,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:14,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:14,232 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:14,232 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-1.i_Iteration6_Lasso [2019-11-28 20:34:14,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:14,232 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:14,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,705 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-11-28 20:34:14,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:14,983 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-28 20:34:15,340 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-28 20:34:15,501 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:15,501 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 20:34:15,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:15,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:15,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:15,510 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 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 [2019-11-28 20:34:15,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:15,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:15,527 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:15,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:15,538 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 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 [2019-11-28 20:34:15,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:15,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:15,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:15,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 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 [2019-11-28 20:34:15,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:15,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:15,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:15,560 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 [2019-11-28 20:34:15,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:15,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:15,574 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 [2019-11-28 20:34:15,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:15,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:15,595 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:15,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:15,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:15,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,609 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:15,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:15,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:15,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,622 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:15,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,635 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:34:15,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,645 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 20:34:15,645 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,664 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:15,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:15,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:15,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:15,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:15,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:15,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:15,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:15,775 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-28 20:34:15,775 INFO L444 ModelExtractionUtils]: 51 out of 73 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:15,780 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:15,781 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:15,781 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-11-28 20:34:15,839 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2019-11-28 20:34:15,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:15,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:34:15,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:15,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:34:15,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:15,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:15,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:34:15,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 36 states and 51 transitions. Complement of second has 8 states. [2019-11-28 20:34:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 20:34:15,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 20:34:15,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:15,974 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:34:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:16,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:34:16,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:16,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:34:16,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:16,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:16,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:34:16,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 36 states and 51 transitions. Complement of second has 8 states. [2019-11-28 20:34:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-28 20:34:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 20:34:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:16,085 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:34:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:16,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:34:16,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:16,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:34:16,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:16,164 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:16,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-28 20:34:16,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 34 states and 51 transitions. Complement of second has 7 states. [2019-11-28 20:34:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-28 20:34:16,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 20:34:16,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:16,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 20:34:16,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:16,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-28 20:34:16,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:16,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2019-11-28 20:34:16,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:34:16,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-11-28 20:34:16,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:34:16,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:34:16,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:34:16,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:16,227 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:16,227 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:16,227 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:16,227 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:34:16,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:34:16,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:34:16,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:34:16,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:34:16 BoogieIcfgContainer [2019-11-28 20:34:16,234 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:34:16,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:34:16,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:34:16,234 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:34:16,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:05" (3/4) ... [2019-11-28 20:34:16,238 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:34:16,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:34:16,240 INFO L168 Benchmark]: Toolchain (without parser) took 11411.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 960.4 MB in the beginning and 1.4 GB in the end (delta: -406.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:16,241 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:16,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:16,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:16,243 INFO L168 Benchmark]: Boogie Preprocessor took 32.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:16,243 INFO L168 Benchmark]: RCFGBuilder took 400.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:16,244 INFO L168 Benchmark]: BuchiAutomizer took 10322.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -262.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:16,244 INFO L168 Benchmark]: Witness Printer took 4.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:16,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 400.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10322.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -262.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[__builtin_alloca (Alen * sizeof(int))] and consists of 4 locations. One deterministic module has affine ranking function -2 * j + unknown-#length-unknown[__builtin_alloca (Blen * sizeof(int))] and consists of 6 locations. One nondeterministic module has affine ranking function -1 * B + unknown-#length-unknown[__builtin_alloca (Blen * sizeof(int))] + -4 * j and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 108 SDtfs, 119 SDslu, 71 SDs, 0 SdLazy, 87 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital264 mio100 ax106 hnf99 lsp84 ukn88 mio100 lsp52 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...