./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/aviad_true-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3607a2efd08edc90448739913473b3ff26ff3cc3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:20,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:20,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:20,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:20,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:20,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:20,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:20,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:20,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:20,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:20,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:20,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:20,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:20,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:20,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:20,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:20,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:20,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:20,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:20,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:20,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:20,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:20,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:20,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:20,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:20,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:20,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:20,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:20,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:20,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:20,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:20,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:20,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:20,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:20,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:20,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:20,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:20,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:20,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:20,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:20,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:20,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:20,672 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:20,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:20,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:20,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:20,678 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:20,679 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:20,680 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:20,680 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:20,680 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:20,682 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:20,683 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:20,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:20,683 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:20,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:20,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:20,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:20,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:20,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:20,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:20,686 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:20,687 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:20,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:20,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:20,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:20,689 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:20,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:20,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:20,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:20,690 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:20,692 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:20,692 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 -> 3607a2efd08edc90448739913473b3ff26ff3cc3 [2020-07-29 01:34:21,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:21,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:21,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:21,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:21,040 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:21,041 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2020-07-29 01:34:21,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d843b0f/f654e7c58ac2427d9d1e9732cd1bb9c5/FLAG0fdec4c6f [2020-07-29 01:34:21,618 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:21,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2020-07-29 01:34:21,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d843b0f/f654e7c58ac2427d9d1e9732cd1bb9c5/FLAG0fdec4c6f [2020-07-29 01:34:21,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d843b0f/f654e7c58ac2427d9d1e9732cd1bb9c5 [2020-07-29 01:34:21,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:21,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:21,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:21,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:21,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:21,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:21" (1/1) ... [2020-07-29 01:34:21,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183ce8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:21, skipping insertion in model container [2020-07-29 01:34:21,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:21" (1/1) ... [2020-07-29 01:34:21,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:22,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:22,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:22,458 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:22,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:22,568 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:22,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22 WrapperNode [2020-07-29 01:34:22,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:22,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:22,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:22,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:22,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:22,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:22,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:22,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:22,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... [2020-07-29 01:34:22,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:22,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:22,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:22,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:22,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:22,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:23,258 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:23,259 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:23,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:23 BoogieIcfgContainer [2020-07-29 01:34:23,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:23,264 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:23,264 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:23,267 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:23,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:23,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:21" (1/3) ... [2020-07-29 01:34:23,269 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@115d9218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:23, skipping insertion in model container [2020-07-29 01:34:23,269 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:23,269 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:22" (2/3) ... [2020-07-29 01:34:23,269 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@115d9218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:23, skipping insertion in model container [2020-07-29 01:34:23,270 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:23,270 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:23" (3/3) ... [2020-07-29 01:34:23,272 INFO L371 chiAutomizerObserver]: Analyzing ICFG aviad_true-alloca.i [2020-07-29 01:34:23,324 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:23,325 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:23,325 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:23,325 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:23,325 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:23,325 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:23,326 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:23,326 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:23,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:34:23,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:23,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:23,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:23,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:23,370 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:23,370 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:23,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:34:23,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:23,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:23,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:23,374 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:23,374 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:23,380 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); 6#L554-3true [2020-07-29 01:34:23,381 INFO L796 eck$LassoCheckResult]: Loop: 6#L554-3true call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); 4#L554-1true assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); 7#L556true assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; 13#L556-2true call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; 6#L554-3true [2020-07-29 01:34:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:23,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:23,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848993665] [2020-07-29 01:34:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:23,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:23,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:23,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1144136, now seen corresponding path program 1 times [2020-07-29 01:34:23,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:23,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095079109] [2020-07-29 01:34:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:23,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:23,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:23,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2020-07-29 01:34:23,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:23,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126988266] [2020-07-29 01:34:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:23,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:23,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:23,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:23,895 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-07-29 01:34:23,958 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:24,172 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2020-07-29 01:34:24,652 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-07-29 01:34:24,896 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-07-29 01:34:24,911 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:24,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:24,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:24,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:24,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:24,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:24,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:24,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: aviad_true-alloca.i_Iteration1_Lasso [2020-07-29 01:34:24,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:24,914 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:24,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:24,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:24,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:24,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,484 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2020-07-29 01:34:25,783 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-07-29 01:34:25,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:25,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:26,340 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-07-29 01:34:26,989 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:26,997 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:27,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,021 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 [2020-07-29 01:34:27,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:27,075 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) [2020-07-29 01:34:27,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,113 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:27,152 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:27,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:27,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,273 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 [2020-07-29 01:34:27,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:27,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:27,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:27,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:27,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:27,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:27,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:27,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:27,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:27,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:27,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:27,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:27,794 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:27,814 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:34:27,814 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. 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) [2020-07-29 01:34:27,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:27,835 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:27,836 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:27,837 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:28,041 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:34:28,112 INFO L393 LassoCheck]: Loop: "call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);" "assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4);" "assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9;" "call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11;" [2020-07-29 01:34:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:28,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:28,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:28,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:34:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:28,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:28,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:34:28,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); {156#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) unseeded)} is VALID [2020-07-29 01:34:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:28,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:28,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:28,509 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:28,509 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 49 [2020-07-29 01:34:28,533 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:34:28,566 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:28,630 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:28,679 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:34:28,707 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:28,767 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:28,789 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:28,896 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-07-29 01:34:28,898 INFO L624 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2020-07-29 01:34:28,921 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:28,928 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:28,928 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2020-07-29 01:34:28,935 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:28,935 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_59|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset]. (let ((.cse0 (select (select |v_#memory_int_59| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (and (= (store |v_#memory_int_59| ULTIMATE.start_f_~tmp~0.base (store (select |v_#memory_int_59| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset (mod .cse0 2))) |#memory_int|) (<= .cse0 oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 2 .cse0))) [2020-07-29 01:34:28,936 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_1, ULTIMATE.start_f_~tmp~0.offset, ULTIMATE.start_f_~tmp~0.base]. (and (<= v_arrayElimCell_1 oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (or (= v_arrayElimCell_1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_1) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (= (mod v_arrayElimCell_1 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset))) [2020-07-29 01:34:28,959 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:29,125 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:29,186 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:29,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:34:29,220 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:29,221 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:29,256 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:29,257 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-07-29 01:34:29,264 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:29,344 INFO L624 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2020-07-29 01:34:29,361 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-29 01:34:29,362 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2020-07-29 01:34:29,706 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:29,707 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_60|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_1]. (let ((.cse4 (select |v_#memory_int_60| ULTIMATE.start_f_~a_ref~0.base))) (let ((.cse1 (select .cse4 ULTIMATE.start_f_~a_ref~0.offset))) (let ((.cse0 (= (store |v_#memory_int_60| ULTIMATE.start_f_~a_ref~0.base (store .cse4 ULTIMATE.start_f_~a_ref~0.offset (+ .cse1 (- 1)))) |#memory_int|)) (.cse2 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse3 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))) (or (and .cse0 (= .cse1 (mod v_arrayElimCell_1 2)) (<= v_arrayElimCell_1 oldRank0) .cse2 (<= 2 v_arrayElimCell_1) .cse3) (and .cse0 .cse2 (<= .cse1 oldRank0) .cse3 (= (select (select |v_#memory_int_60| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset) (mod .cse1 2)) (<= 2 .cse1)))))) [2020-07-29 01:34:29,707 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_1]. (let ((.cse1 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse2 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (or (and (= (+ (mod v_arrayElimCell_1 2) (- 1)) .cse0) (<= v_arrayElimCell_1 oldRank0) .cse1 (<= 2 v_arrayElimCell_1) .cse2) (let ((.cse3 (+ .cse0 1))) (and (<= .cse3 oldRank0) .cse1 .cse2 (= (mod .cse3 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= 1 .cse0))))) [2020-07-29 01:34:29,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); {168#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:34:29,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); {172#(and (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int) (v_arrayElimCell_1 Int)) (and (<= v_arrayElimCell_1 oldRank0) (or (= v_arrayElimCell_1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_1) (= (mod v_arrayElimCell_1 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:30,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {172#(and (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int) (v_arrayElimCell_1 Int)) (and (<= v_arrayElimCell_1 oldRank0) (or (= v_arrayElimCell_1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_1) (= (mod v_arrayElimCell_1 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; {176#(or (and (exists ((v_arrayElimCell_1 Int)) (and (= (mod v_arrayElimCell_1 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1)) (<= v_arrayElimCell_1 oldRank0) (<= 2 v_arrayElimCell_1))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} is UNKNOWN [2020-07-29 01:34:30,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {176#(or (and (exists ((v_arrayElimCell_1 Int)) (and (= (mod v_arrayElimCell_1 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1)) (<= v_arrayElimCell_1 oldRank0) (<= 2 v_arrayElimCell_1))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; {159#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:30,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:32,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:32,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,204 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:34:32,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2020-07-29 01:34:32,421 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 27 states and 34 transitions. Complement of second has 10 states. [2020-07-29 01:34:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:32,421 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:32,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:34:32,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:32,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:32,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:32,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:34:32,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:32,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:32,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:32,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-07-29 01:34:32,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:32,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:32,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:32,434 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:34:32,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:32,437 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:32,437 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:34:32,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:32,439 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:32,440 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 9 [2020-07-29 01:34:32,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:32,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:32,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:32,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:32,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:34:32,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:34:32,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:34:32,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:32,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:32,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:32,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:32,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:32,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:32,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:32,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:32,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:32,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:32,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:32,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:32,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,459 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:34:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-29 01:34:32,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:32,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:32,463 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:34:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:32,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 01:34:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:32,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:32,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:34:32,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); {156#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) unseeded)} is VALID [2020-07-29 01:34:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:32,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:32,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:32,687 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:32,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 49 [2020-07-29 01:34:32,706 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:34:32,749 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:32,820 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:32,872 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:34:32,919 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:32,983 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:33,035 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:33,082 INFO L624 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2020-07-29 01:34:33,113 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:33,120 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:33,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2020-07-29 01:34:33,126 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:33,127 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset]. (let ((.cse0 (select (select |v_#memory_int_61| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (<= .cse0 oldRank0) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 2 .cse0) (= (store |v_#memory_int_61| ULTIMATE.start_f_~tmp~0.base (store (select |v_#memory_int_61| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset (mod .cse0 2))) |#memory_int|))) [2020-07-29 01:34:33,127 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_5, ULTIMATE.start_f_~tmp~0.offset, ULTIMATE.start_f_~tmp~0.base]. (and (<= 2 v_arrayElimCell_5) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (or (= v_arrayElimCell_5 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= v_arrayElimCell_5 oldRank0) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (= (mod v_arrayElimCell_5 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset))) [2020-07-29 01:34:33,144 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:33,306 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:33,331 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:33,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:34:33,400 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:33,400 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-07-29 01:34:33,410 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:33,421 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:33,421 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:33,502 INFO L624 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2020-07-29 01:34:33,523 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-29 01:34:33,524 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2020-07-29 01:34:33,614 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:33,614 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_62|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_5]. (let ((.cse4 (select |v_#memory_int_62| ULTIMATE.start_f_~a_ref~0.base))) (let ((.cse0 (select .cse4 ULTIMATE.start_f_~a_ref~0.offset))) (let ((.cse1 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse2 (= (store |v_#memory_int_62| ULTIMATE.start_f_~a_ref~0.base (store .cse4 ULTIMATE.start_f_~a_ref~0.offset (+ .cse0 (- 1)))) |#memory_int|)) (.cse3 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))) (or (and (= (mod .cse0 2) (select (select |v_#memory_int_62| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= 2 .cse0) .cse1 .cse2 .cse3 (<= .cse0 oldRank0)) (and (<= 2 v_arrayElimCell_5) .cse1 (= (mod v_arrayElimCell_5 2) .cse0) (<= v_arrayElimCell_5 oldRank0) .cse2 .cse3))))) [2020-07-29 01:34:33,614 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_5]. (let ((.cse0 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse1 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse2 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (or (and (<= 2 v_arrayElimCell_5) .cse0 (<= v_arrayElimCell_5 oldRank0) .cse1 (= (+ (mod v_arrayElimCell_5 2) (- 1)) .cse2)) (let ((.cse3 (+ .cse2 1))) (and (<= .cse3 oldRank0) .cse0 .cse1 (= (mod .cse3 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= 1 .cse2))))) [2020-07-29 01:34:33,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); {230#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:34:33,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); {234#(and (exists ((ULTIMATE.start_f_~tmp~0.base Int) (v_arrayElimCell_5 Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (and (<= 2 v_arrayElimCell_5) (or (= v_arrayElimCell_5 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= v_arrayElimCell_5 oldRank0) (= (mod v_arrayElimCell_5 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:33,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {234#(and (exists ((ULTIMATE.start_f_~tmp~0.base Int) (v_arrayElimCell_5 Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (and (<= 2 v_arrayElimCell_5) (or (= v_arrayElimCell_5 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= v_arrayElimCell_5 oldRank0) (= (mod v_arrayElimCell_5 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; {238#(or (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))) (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_5 Int)) (and (<= 2 v_arrayElimCell_5) (<= v_arrayElimCell_5 oldRank0) (= (mod v_arrayElimCell_5 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1))))))} is VALID [2020-07-29 01:34:33,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {238#(or (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))) (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_5 Int)) (and (<= 2 v_arrayElimCell_5) (<= v_arrayElimCell_5 oldRank0) (= (mod v_arrayElimCell_5 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1))))))} call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; {159#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:33,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:35,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:35,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:35,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:35,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:34:35,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2020-07-29 01:34:40,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 28 states and 35 transitions. Complement of second has 10 states. [2020-07-29 01:34:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:40,232 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:40,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:34:40,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:40,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:40,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:40,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:34:40,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:34:40,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:40,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:40,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 01:34:40,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:34:40,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:40,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:40,239 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:34:40,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:40,241 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:40,241 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:34:40,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:34:40,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:40,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 10 [2020-07-29 01:34:40,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:34:40,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:40,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:40,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:40,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:34:40,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:34:40,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:34:40,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:40,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:40,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:40,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:40,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:40,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:40,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:40,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:40,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:40,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:40,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:40,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:40,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:40,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:40,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:40,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:40,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:40,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:40,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:40,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:40,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:40,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,264 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:34:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-29 01:34:40,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:40,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:40,267 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:34:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:40,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:40,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:40,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:34:40,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); {156#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) unseeded)} is VALID [2020-07-29 01:34:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:40,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:40,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:40,493 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:40,493 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 49 [2020-07-29 01:34:40,513 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:34:40,535 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:40,588 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:40,644 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:34:40,672 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:34:40,735 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:40,767 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:40,814 INFO L624 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2020-07-29 01:34:40,847 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:40,849 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:40,850 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2020-07-29 01:34:40,860 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:40,860 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset]. (let ((.cse0 (select (select |v_#memory_int_63| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (= (store |v_#memory_int_63| ULTIMATE.start_f_~tmp~0.base (store (select |v_#memory_int_63| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset (mod .cse0 2))) |#memory_int|) (<= 2 .cse0) (<= .cse0 oldRank0))) [2020-07-29 01:34:40,860 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_9, ULTIMATE.start_f_~tmp~0.offset, ULTIMATE.start_f_~tmp~0.base]. (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) (= (mod v_arrayElimCell_9 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (or (= v_arrayElimCell_9 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base)))) [2020-07-29 01:34:40,880 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:41,043 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:41,072 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:41,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:34:41,110 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:41,111 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:41,152 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:41,152 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-07-29 01:34:41,158 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:41,238 INFO L624 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2020-07-29 01:34:41,258 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-29 01:34:41,258 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2020-07-29 01:34:41,305 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:41,305 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_64|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_9]. (let ((.cse4 (select |v_#memory_int_64| ULTIMATE.start_f_~a_ref~0.base))) (let ((.cse3 (select .cse4 ULTIMATE.start_f_~a_ref~0.offset))) (let ((.cse0 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse1 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse2 (= |#memory_int| (store |v_#memory_int_64| ULTIMATE.start_f_~a_ref~0.base (store .cse4 ULTIMATE.start_f_~a_ref~0.offset (+ .cse3 (- 1))))))) (or (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) .cse0 .cse1 .cse2 (= (mod v_arrayElimCell_9 2) .cse3)) (and .cse0 (<= .cse3 oldRank0) (= (mod .cse3 2) (select (select |v_#memory_int_64| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) .cse1 (<= 2 .cse3) .cse2))))) [2020-07-29 01:34:41,305 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_9]. (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (let ((.cse0 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse1 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse2 (+ .cse3 1))) (or (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) .cse0 .cse1 (= .cse2 (mod v_arrayElimCell_9 2))) (and (<= .cse2 oldRank0) .cse0 .cse1 (= (mod .cse2 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= 1 .cse3))))) [2020-07-29 01:34:41,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); {293#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:34:41,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {293#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); {297#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (exists ((v_arrayElimCell_9 Int) (ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) (= (mod v_arrayElimCell_9 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (or (= v_arrayElimCell_9 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))))) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:42,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {297#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (exists ((v_arrayElimCell_9 Int) (ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) (= (mod v_arrayElimCell_9 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (or (= v_arrayElimCell_9 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))))) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; {301#(or (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_9 Int)) (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) (= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) (mod v_arrayElimCell_9 2))))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} is UNKNOWN [2020-07-29 01:34:42,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {301#(or (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_9 Int)) (and (<= v_arrayElimCell_9 oldRank0) (<= 2 v_arrayElimCell_9) (= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) (mod v_arrayElimCell_9 2))))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; {159#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:42,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:44,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:44,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:44,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,832 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:34:44,832 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2020-07-29 01:34:45,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 28 states and 35 transitions. Complement of second has 9 states. [2020-07-29 01:34:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:45,037 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:45,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:34:45,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:45,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:34:45,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:45,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 01:34:45,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:45,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:34:45,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:45,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:45,047 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:34:45,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:45,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:45,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:34:45,051 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:45,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:45,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:45,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:45,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:34:45,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:34:45,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:34:45,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:45,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:45,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:45,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:45,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:45,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:45,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:45,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:45,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:45,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:45,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:45,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:45,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:45,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:45,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:45,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:45,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:45,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:45,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:45,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:45,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:45,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:45,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:45,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:45,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:45,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:45,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:45,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:45,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,069 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:34:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-29 01:34:45,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:45,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,071 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:34:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:45,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:34:45,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); {156#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) unseeded)} is VALID [2020-07-29 01:34:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:45,303 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:45,304 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 49 [2020-07-29 01:34:45,324 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:45,340 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:45,404 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:45,423 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:45,460 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:45,509 INFO L624 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2020-07-29 01:34:45,529 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:45,533 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:45,533 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2020-07-29 01:34:45,542 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:45,543 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_65|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset]. (let ((.cse0 (select (select |v_#memory_int_65| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (and (<= .cse0 oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (<= 2 .cse0) (= (store |v_#memory_int_65| ULTIMATE.start_f_~tmp~0.base (store (select |v_#memory_int_65| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset (mod .cse0 2))) |#memory_int|) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))) [2020-07-29 01:34:45,543 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_13, ULTIMATE.start_f_~tmp~0.offset, ULTIMATE.start_f_~tmp~0.base]. (and (or (= v_arrayElimCell_13 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 2 v_arrayElimCell_13) (= (mod v_arrayElimCell_13 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= v_arrayElimCell_13 oldRank0)) [2020-07-29 01:34:45,564 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:45,692 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:45,711 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:45,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:34:45,752 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:45,752 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:45,792 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:45,793 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-07-29 01:34:45,796 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:45,870 INFO L624 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2020-07-29 01:34:45,886 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-29 01:34:45,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2020-07-29 01:34:45,935 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:45,935 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_66|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_13]. (let ((.cse4 (select |v_#memory_int_66| ULTIMATE.start_f_~a_ref~0.base))) (let ((.cse3 (select .cse4 ULTIMATE.start_f_~a_ref~0.offset))) (let ((.cse0 (= (store |v_#memory_int_66| ULTIMATE.start_f_~a_ref~0.base (store .cse4 ULTIMATE.start_f_~a_ref~0.offset (+ .cse3 (- 1)))) |#memory_int|)) (.cse1 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse2 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))) (or (and .cse0 .cse1 .cse2 (= .cse3 (mod v_arrayElimCell_13 2)) (<= 2 v_arrayElimCell_13) (<= v_arrayElimCell_13 oldRank0)) (and (<= 2 .cse3) .cse0 .cse1 (= (select (select |v_#memory_int_66| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset) (mod .cse3 2)) .cse2 (<= .cse3 oldRank0)))))) [2020-07-29 01:34:45,935 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_13]. (let ((.cse1 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse2 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse3 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (or (let ((.cse0 (+ .cse3 1))) (and (<= .cse0 oldRank0) .cse1 .cse2 (= (mod .cse0 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= 1 .cse3))) (and .cse1 .cse2 (= (+ (mod v_arrayElimCell_13 2) (- 1)) .cse3) (<= 2 v_arrayElimCell_13) (<= v_arrayElimCell_13 oldRank0)))) [2020-07-29 01:34:46,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); {355#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:34:46,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); {359#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int) (v_arrayElimCell_13 Int)) (and (or (= v_arrayElimCell_13 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_13) (= (mod v_arrayElimCell_13 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= v_arrayElimCell_13 oldRank0))))} is VALID [2020-07-29 01:34:47,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int) (v_arrayElimCell_13 Int)) (and (or (= v_arrayElimCell_13 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_13) (= (mod v_arrayElimCell_13 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= v_arrayElimCell_13 oldRank0))))} assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; {363#(or (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_13 Int)) (and (= (mod v_arrayElimCell_13 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1)) (<= 2 v_arrayElimCell_13) (<= v_arrayElimCell_13 oldRank0)))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} is UNKNOWN [2020-07-29 01:34:47,118 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#(or (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_13 Int)) (and (= (mod v_arrayElimCell_13 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1)) (<= 2 v_arrayElimCell_13) (<= v_arrayElimCell_13 oldRank0)))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; {159#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:47,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:49,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:49,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:49,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:49,257 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:34:49,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2020-07-29 01:34:53,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 29 states and 36 transitions. Complement of second has 9 states. [2020-07-29 01:34:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:53,663 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:53,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:34:53,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:53,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:53,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:53,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:34:53,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:34:53,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:53,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:53,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-07-29 01:34:53,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:34:53,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:53,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:53,669 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:34:53,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:53,671 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:53,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:34:53,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:34:53,673 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:53,673 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 10 [2020-07-29 01:34:53,674 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:34:53,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:53,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:34:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:34:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:34:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:53,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:53,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:53,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:53,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:53,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:53,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:53,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:53,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:34:53,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:53,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:34:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:53,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:53,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:34:53,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:53,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:53,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,696 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:34:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-29 01:34:53,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:53,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:53,698 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:34:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:53,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:53,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:53,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2020-07-29 01:34:53,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); {156#(and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) unseeded)} is VALID [2020-07-29 01:34:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:53,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:53,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:53,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:53,913 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 49 [2020-07-29 01:34:53,931 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:53,949 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:54,020 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-29 01:34:54,037 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:54,100 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:54,153 INFO L624 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2020-07-29 01:34:54,170 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:54,173 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:54,173 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2020-07-29 01:34:54,179 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:54,180 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_67|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset]. (let ((.cse0 (select (select |v_#memory_int_67| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (and (<= 2 .cse0) (= (store |v_#memory_int_67| ULTIMATE.start_f_~tmp~0.base (store (select |v_#memory_int_67| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset (mod .cse0 2))) |#memory_int|) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= .cse0 oldRank0))) [2020-07-29 01:34:54,180 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_17, ULTIMATE.start_f_~tmp~0.offset, ULTIMATE.start_f_~tmp~0.base]. (and (= (mod v_arrayElimCell_17 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= v_arrayElimCell_17 oldRank0) (or (= v_arrayElimCell_17 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 2 v_arrayElimCell_17)) [2020-07-29 01:34:54,204 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:54,380 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:54,410 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:54,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:34:54,468 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:54,469 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-07-29 01:34:54,474 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:54,484 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-29 01:34:54,485 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:54,567 INFO L624 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2020-07-29 01:34:54,583 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-29 01:34:54,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2020-07-29 01:34:54,629 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:54,629 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_68|, ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_17]. (let ((.cse4 (select |v_#memory_int_68| ULTIMATE.start_f_~a_ref~0.base))) (let ((.cse1 (select .cse4 ULTIMATE.start_f_~a_ref~0.offset))) (let ((.cse0 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse2 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse3 (= |#memory_int| (store |v_#memory_int_68| ULTIMATE.start_f_~a_ref~0.base (store .cse4 ULTIMATE.start_f_~a_ref~0.offset (+ .cse1 (- 1))))))) (or (and .cse0 (= (select (select |v_#memory_int_68| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset) (mod .cse1 2)) .cse2 (<= 2 .cse1) (<= .cse1 oldRank0) .cse3) (and (= (mod v_arrayElimCell_17 2) .cse1) (<= v_arrayElimCell_17 oldRank0) .cse0 .cse2 .cse3 (<= 2 v_arrayElimCell_17)))))) [2020-07-29 01:34:54,630 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~tmp~0.base, ULTIMATE.start_f_~tmp~0.offset, v_arrayElimCell_17]. (let ((.cse1 (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|))) (.cse2 (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base)) (.cse0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset))) (or (and (<= v_arrayElimCell_17 oldRank0) (= (+ (mod v_arrayElimCell_17 2) (- 1)) .cse0) .cse1 .cse2 (<= 2 v_arrayElimCell_17)) (let ((.cse3 (+ .cse0 1))) (and (<= .cse3 oldRank0) .cse1 .cse2 (= (mod .cse3 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= 1 .cse0))))) [2020-07-29 01:34:54,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); {418#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:34:54,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {418#(and (<= |ULTIMATE.start_f_#t~mem5| (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) oldRank0))} assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); {422#(and (exists ((ULTIMATE.start_f_~tmp~0.base Int) (v_arrayElimCell_17 Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (and (= (mod v_arrayElimCell_17 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= v_arrayElimCell_17 oldRank0) (or (= v_arrayElimCell_17 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_17))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:55,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {422#(and (exists ((ULTIMATE.start_f_~tmp~0.base Int) (v_arrayElimCell_17 Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (and (= (mod v_arrayElimCell_17 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)) (<= v_arrayElimCell_17 oldRank0) (or (= v_arrayElimCell_17 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (and (= ULTIMATE.start_f_~tmp~0.offset ULTIMATE.start_f_~a_ref~0.offset) (= ULTIMATE.start_f_~tmp~0.base ULTIMATE.start_f_~a_ref~0.base))) (<= 2 v_arrayElimCell_17))) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; {426#(or (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_17 Int)) (and (<= v_arrayElimCell_17 oldRank0) (= (mod v_arrayElimCell_17 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1)) (<= 2 v_arrayElimCell_17)))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} is UNKNOWN [2020-07-29 01:34:55,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {426#(or (and (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (exists ((v_arrayElimCell_17 Int)) (and (<= v_arrayElimCell_17 oldRank0) (= (mod v_arrayElimCell_17 2) (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1)) (<= 2 v_arrayElimCell_17)))) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) oldRank0) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (exists ((ULTIMATE.start_f_~tmp~0.base Int) (ULTIMATE.start_f_~tmp~0.offset Int)) (= (mod (+ (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset) 1) 2) (select (select |#memory_int| ULTIMATE.start_f_~tmp~0.base) ULTIMATE.start_f_~tmp~0.offset)))))} call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; {159#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_f_~count~0.base |ULTIMATE.start_f_#t~malloc2.base|)) (= |ULTIMATE.start_f_#t~malloc2.base| ULTIMATE.start_f_~a_ref~0.base))} is VALID [2020-07-29 01:34:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:55,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:55,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:34:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:55,980 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:34:55,982 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 11 states. Second operand 5 states. [2020-07-29 01:35:10,136 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 11 states. Second operand 5 states. Result 71 states and 89 transitions. Complement of second has 42 states 10 powerset states32 rank states. The highest rank that occured is 3 [2020-07-29 01:35:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-07-29 01:35:10,137 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2020-07-29 01:35:10,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:35:10,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:10,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:35:10,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:35:10,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 89 transitions. [2020-07-29 01:35:10,143 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:10,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:10,144 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:35:10,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:10,145 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:35:10,145 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:35:10,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:35:10,148 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:10,148 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 71 states and 89 transitions. cyclomatic complexity: 20 [2020-07-29 01:35:10,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 89 transitions. cyclomatic complexity: 20 [2020-07-29 01:35:10,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:10,149 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 71 letters. Loop has 71 letters. [2020-07-29 01:35:10,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 71 letters. Loop has 71 letters. [2020-07-29 01:35:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 71 letters. Loop has 71 letters. [2020-07-29 01:35:10,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:35:10,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:35:10,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:35:10,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:10,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:10,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:10,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:35:10,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:35:10,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:35:10,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:10,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:10,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:10,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:10,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:10,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:35:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:35:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:35:10,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 89 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:10,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,164 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2020-07-29 01:35:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:35:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-29 01:35:10,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:35:10,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:10,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 44 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:10,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 89 transitions. cyclomatic complexity: 20 [2020-07-29 01:35:10,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:10,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2020-07-29 01:35:10,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:10,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:10,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:10,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:10,180 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:10,180 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:10,180 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:10,180 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:10,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:10,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:10,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:10,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:10 BoogieIcfgContainer [2020-07-29 01:35:10,188 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:10,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:10,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:10,189 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:10,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:23" (3/4) ... [2020-07-29 01:35:10,194 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:10,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:10,196 INFO L168 Benchmark]: Toolchain (without parser) took 48263.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 960.2 MB in the beginning and 986.9 MB in the end (delta: -26.7 MB). Peak memory consumption was 300.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,197 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:10,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.52 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. [2020-07-29 01:35:10,199 INFO L168 Benchmark]: Boogie Preprocessor took 31.55 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,200 INFO L168 Benchmark]: RCFGBuilder took 603.97 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,201 INFO L168 Benchmark]: BuchiAutomizer took 46924.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 98.3 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,202 INFO L168 Benchmark]: Witness Printer took 5.72 ms. Allocated memory is still 1.4 GB. Free memory is still 986.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:10,206 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.52 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. * Boogie Preprocessor took 31.55 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 603.97 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46924.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 98.3 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.72 ms. Allocated memory is still 1.4 GB. Free memory is still 986.9 MB. 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 #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a_ref][a_ref] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 14.7s. Büchi inclusion checks took 27.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [0, 0, 0, 0, 1]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 43 SDtfs, 38 SDslu, 18 SDs, 0 SdLazy, 136 SolverSat, 41 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 14.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital433 mio100 ax104 hnf100 lsp94 ukn42 mio100 lsp40 div100 bol100 ite100 ukn100 eq182 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...