./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/stroeder2-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash fa1df4216228ace3c3c1088507575f9600e9db06 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:26:34,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:34,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:34,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:34,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:34,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:34,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:34,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:34,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:34,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:34,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:34,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:34,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:34,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:34,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:34,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:34,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:34,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:34,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:34,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:34,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:34,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:34,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:34,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:34,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:34,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:34,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:34,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:34,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:34,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:34,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:34,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:34,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:34,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:34,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:34,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:34,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:34,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:34,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:34,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:34,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:34,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:34,401 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:34,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:34,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:34,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:34,408 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:34,408 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:34,409 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:34,410 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:34,410 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:34,411 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:34,411 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:34,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:34,412 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:34,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:34,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:34,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:34,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:34,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:34,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:34,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:34,415 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:34,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:34,415 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:34,416 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:34,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:34,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:34,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:34,417 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:34,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:34,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:34,418 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:34,419 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:34,420 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:34,420 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa1df4216228ace3c3c1088507575f9600e9db06 [2020-07-29 03:26:34,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:34,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:34,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:34,766 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:34,767 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:34,768 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2020-07-29 03:26:34,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/576a14c6f/e110760c4ecf4ef7bb1d80fc59338c7c/FLAG88ee26e1b [2020-07-29 03:26:35,355 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:35,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2020-07-29 03:26:35,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/576a14c6f/e110760c4ecf4ef7bb1d80fc59338c7c/FLAG88ee26e1b [2020-07-29 03:26:35,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/576a14c6f/e110760c4ecf4ef7bb1d80fc59338c7c [2020-07-29 03:26:35,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:35,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:35,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:35,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:35,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:35,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:35" (1/1) ... [2020-07-29 03:26:35,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d44add4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:35, skipping insertion in model container [2020-07-29 03:26:35,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:35" (1/1) ... [2020-07-29 03:26:35,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:35,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:36,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:36,148 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:36,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:36,257 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:36,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36 WrapperNode [2020-07-29 03:26:36,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:36,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:36,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:36,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:36,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:36,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:36,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:36,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:36,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (1/1) ... [2020-07-29 03:26:36,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:36,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:36,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:36,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:36,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (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 03:26:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:36,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:36,765 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:36,766 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:26:36,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:36 BoogieIcfgContainer [2020-07-29 03:26:36,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:36,771 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:36,772 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:36,776 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:36,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:36,778 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:35" (1/3) ... [2020-07-29 03:26:36,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4462bb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:36, skipping insertion in model container [2020-07-29 03:26:36,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:36,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:36" (2/3) ... [2020-07-29 03:26:36,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4462bb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:36, skipping insertion in model container [2020-07-29 03:26:36,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:36,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:36" (3/3) ... [2020-07-29 03:26:36,783 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-1.i [2020-07-29 03:26:36,839 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:36,840 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:36,840 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:36,840 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:36,841 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:36,841 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:36,841 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:36,841 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:36,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:26:36,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:36,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:36,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:36,915 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:36,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:26:36,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:36,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:26:36,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:36,927 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 14#L529true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 18#L529-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 10#L534-3true [2020-07-29 03:26:36,928 INFO L796 eck$LassoCheckResult]: Loop: 10#L534-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 8#L534-2true main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 10#L534-3true [2020-07-29 03:26:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:26:36,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326588165] [2020-07-29 03:26:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:26:37,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:37,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524881487] [2020-07-29 03:26:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:26:37,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:37,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237248483] [2020-07-29 03:26:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:37,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:37,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:37,467 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:37,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:37,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:37,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:37,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:37,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:37,471 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:37,471 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:37,471 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration1_Lasso [2020-07-29 03:26:37,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:37,472 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:37,532 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 03:26:37,545 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 03:26:37,715 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 03:26:37,725 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 03:26:37,731 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 03:26:37,738 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 03:26:37,756 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 03:26:37,763 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 03:26:37,769 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 03:26:37,774 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 03:26:38,330 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:38,335 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,342 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 03:26:38,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:38,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,416 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 03:26:38,460 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 03:26:38,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,467 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 03:26:38,469 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) [2020-07-29 03:26:38,509 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 03:26:38,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:38,566 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 03:26:38,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,583 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) [2020-07-29 03:26:38,616 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 03:26:38,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,634 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 03:26:38,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:38,751 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 03:26:38,751 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:38,766 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,770 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:38,770 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:38,771 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2020-07-29 03:26:38,937 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:26:38,942 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10;" "main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9;" [2020-07-29 03:26:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:39,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2020-07-29 03:26:39,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {26#unseeded} is VALID [2020-07-29 03:26:39,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {26#unseeded} is VALID [2020-07-29 03:26:39,059 INFO L280 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {26#unseeded} is VALID [2020-07-29 03:26:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:39,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~array_size~0))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {68#(and (<= ULTIMATE.start_main_~array_size~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~array_size~0))} is VALID [2020-07-29 03:26:39,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#(and (<= ULTIMATE.start_main_~array_size~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~array_size~0))} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {54#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~array_size~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:39,094 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 03:26:39,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:39,122 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 03:26:39,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:39,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-07-29 03:26:39,286 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2020-07-29 03:26:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:39,288 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:39,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:26:39,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:39,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:39,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:39,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2020-07-29 03:26:39,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,311 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states. [2020-07-29 03:26:39,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:39,318 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:39,319 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:39,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:39,325 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:39,325 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2020-07-29 03:26:39,330 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:39,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:39,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:39,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:39,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:39,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:39,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:39,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:39,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:39,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:39,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:39,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:39,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:39,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:39,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:26:39,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:39,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:39,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:26:39,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:39,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:39,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:39,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:39,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:39,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:39,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:39,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:39,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:39,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:39,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:39,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:39,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:39,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:39,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:39,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:39,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:39,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:39,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:39,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:39,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:39,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 53 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:26:39,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,378 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-29 03:26:39,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:26:39,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:39,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:39,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. cyclomatic complexity: 19 [2020-07-29 03:26:39,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2020-07-29 03:26:39,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:26:39,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:26:39,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 03:26:39,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:39,398 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:26:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 03:26:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 03:26:39,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:39,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:39,429 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:39,432 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:39,437 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 03:26:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:26:39,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,438 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 03:26:39,439 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 03:26:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:39,440 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 03:26:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:26:39,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:39,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:26:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 03:26:39,444 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:26:39,444 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:26:39,444 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:39,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:26:39,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:39,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:39,446 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 122#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 123#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 127#L534-3 assume !(main_~i~1 < main_~array_size~0); 128#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 125#L517-3 [2020-07-29 03:26:39,446 INFO L796 eck$LassoCheckResult]: Loop: 125#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 129#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 130#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 124#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 125#L517-3 [2020-07-29 03:26:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:26:39,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821399296] [2020-07-29 03:26:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {159#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {159#true} is VALID [2020-07-29 03:26:39,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {159#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {159#true} is VALID [2020-07-29 03:26:39,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {159#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {161#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:26:39,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {161#(<= 1 ULTIMATE.start_main_~array_size~0)} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {162#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:26:39,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {162#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~array_size~0); {160#false} is VALID [2020-07-29 03:26:39,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {160#false} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {160#false} is VALID [2020-07-29 03:26:39,542 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 03:26:39,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821399296] [2020-07-29 03:26:39,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:39,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:39,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310007259] [2020-07-29 03:26:39,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2020-07-29 03:26:39,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963671403] [2020-07-29 03:26:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:39,668 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 03:26:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:39,743 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:26:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:39,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:39,756 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 03:26:39,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-29 03:26:39,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2020-07-29 03:26:39,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:26:39,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:26:39,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-07-29 03:26:39,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:39,762 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 03:26:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-07-29 03:26:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 03:26:39,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:39,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:39,763 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:39,763 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:26:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:39,765 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:26:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:26:39,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,766 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 16 transitions. [2020-07-29 03:26:39,766 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 16 transitions. [2020-07-29 03:26:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:39,771 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:26:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:26:39,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:39,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:26:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-29 03:26:39,773 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:26:39,773 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:26:39,773 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:39,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-07-29 03:26:39,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:39,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:39,776 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 178#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 179#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 189#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 183#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 180#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 181#L534-3 assume !(main_~i~1 < main_~array_size~0); 184#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 186#L517-3 [2020-07-29 03:26:39,776 INFO L796 eck$LassoCheckResult]: Loop: 186#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 187#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 188#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 185#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 186#L517-3 [2020-07-29 03:26:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,777 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:26:39,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306694917] [2020-07-29 03:26:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2020-07-29 03:26:39,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374734333] [2020-07-29 03:26:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,874 INFO L82 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2020-07-29 03:26:39,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065512244] [2020-07-29 03:26:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,936 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:40,161 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2020-07-29 03:26:40,306 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:40,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:40,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:40,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:40,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:40,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:40,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:40,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:40,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration3_Lasso [2020-07-29 03:26:40,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:40,308 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:40,339 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 03:26:40,343 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 03:26:40,349 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 03:26:40,354 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 03:26:40,357 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 03:26:40,363 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 03:26:40,367 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 03:26:40,371 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 03:26:40,374 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 03:26:40,377 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 03:26:40,380 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 03:26:40,384 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 03:26:40,388 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 03:26:40,393 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 03:26:40,396 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 03:26:40,400 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 03:26:40,569 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:40,569 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:40,573 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 03:26:40,580 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 03:26:41,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:41,327 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 03:26:41,336 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 03:26:41,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,343 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) [2020-07-29 03:26:41,392 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 03:26:41,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,400 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 03:26:41,437 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 03:26:41,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:41,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,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 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 03:26:41,507 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 03:26:41,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,511 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 03:26:41,537 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 03:26:41,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,549 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 03:26:41,589 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 03:26:41,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,594 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 03:26:41,618 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 03:26:41,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,624 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 03:26:41,648 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 03:26:41,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,652 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 03:26:41,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:41,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,686 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) [2020-07-29 03:26:41,745 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 03:26:41,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:41,815 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 03:26:41,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:41,859 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 03:26:41,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,896 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 03:26:41,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:41,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:41,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:41,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,927 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 03:26:41,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:41,959 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 03:26:41,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:41,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:41,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:41,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:41,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:41,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:41,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:42,005 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 03:26:42,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:42,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:42,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:42,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:42,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:42,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:42,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:42,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:42,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:42,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:42,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:42,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:42,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:42,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:42,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:42,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:42,118 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:26:42,119 INFO L444 ModelExtractionUtils]: 32 out of 43 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:42,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:42,125 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:42,125 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:42,125 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2020-07-29 03:26:42,158 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 03:26:42,162 INFO L393 LassoCheck]: Loop: "assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset;" "call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);" "assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;" "sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2;" [2020-07-29 03:26:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:42,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#unseeded} is VALID [2020-07-29 03:26:42,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {225#unseeded} is VALID [2020-07-29 03:26:42,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {225#unseeded} is VALID [2020-07-29 03:26:42,228 INFO L280 TraceCheckUtils]: 3: Hoare triple {225#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {225#unseeded} is VALID [2020-07-29 03:26:42,228 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {225#unseeded} is VALID [2020-07-29 03:26:42,229 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {225#unseeded} is VALID [2020-07-29 03:26:42,230 INFO L280 TraceCheckUtils]: 6: Hoare triple {225#unseeded} assume !(main_~i~1 < main_~array_size~0); {225#unseeded} is VALID [2020-07-29 03:26:42,231 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#unseeded} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {225#unseeded} is VALID [2020-07-29 03:26:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:42,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:42,269 INFO L280 TraceCheckUtils]: 0: Hoare triple {228#(>= oldRank0 (+ ULTIMATE.start_sumOfThirdBytes_~array_size (* (- 1) ULTIMATE.start_sumOfThirdBytes_~i~0)))} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {274#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} is VALID [2020-07-29 03:26:42,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {274#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {274#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} is VALID [2020-07-29 03:26:42,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {274#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {274#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} is VALID [2020-07-29 03:26:42,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {274#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size (+ oldRank0 ULTIMATE.start_sumOfThirdBytes_~i~0)) (< ULTIMATE.start_sumOfThirdBytes_~i~0 ULTIMATE.start_sumOfThirdBytes_~array_size))} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {248#(or (and (> oldRank0 (+ ULTIMATE.start_sumOfThirdBytes_~array_size (* (- 1) ULTIMATE.start_sumOfThirdBytes_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:42,277 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 03:26:42,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:42,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,290 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:42,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 03:26:42,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2020-07-29 03:26:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:42,342 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:42,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:42,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:42,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:42,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:26:42,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:42,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 03:26:42,350 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:42,351 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:42,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:42,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:42,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:42,355 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:42,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:42,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:42,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:42,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:42,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:42,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:26:42,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:26:42,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:26:42,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:26:42,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:42,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:42,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:42,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:42,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:42,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:42,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:42,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:42,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:42,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:42,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:42,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:42,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:26:42,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:26:42,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:26:42,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:42,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,403 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 03:26:42,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:42,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:26:42,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:26:42,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:42,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:42,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:42,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2020-07-29 03:26:42,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:26:42,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:26:42,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-07-29 03:26:42,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:42,411 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 03:26:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-07-29 03:26:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 03:26:42,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:42,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 03:26:42,414 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 03:26:42,414 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 03:26:42,415 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:42,418 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 03:26:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 03:26:42,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,419 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 21 transitions. [2020-07-29 03:26:42,419 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 21 transitions. [2020-07-29 03:26:42,421 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:42,427 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 03:26:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:26:42,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:42,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:26:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 03:26:42,430 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:42,430 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:42,430 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:42,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:42,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:42,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:42,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:42,433 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 309#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 310#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 321#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 311#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 307#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 308#L534-3 assume !(main_~i~1 < main_~array_size~0); 312#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 316#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 318#L520-3 [2020-07-29 03:26:42,434 INFO L796 eck$LassoCheckResult]: Loop: 318#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 319#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 318#L520-3 [2020-07-29 03:26:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-07-29 03:26:42,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007148858] [2020-07-29 03:26:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2020-07-29 03:26:42,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032135617] [2020-07-29 03:26:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2020-07-29 03:26:42,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052803535] [2020-07-29 03:26:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,814 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2020-07-29 03:26:42,939 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:42,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:42,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:42,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:42,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:42,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:42,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:42,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:42,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration4_Lasso [2020-07-29 03:26:42,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:42,940 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:42,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 03:26:42,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:42,989 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 03:26:42,993 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 03:26:42,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 03:26:43,000 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 03:26:43,004 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 03:26:43,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:43,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 03:26:43,016 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 03:26:43,020 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 03:26:43,023 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 03:26:43,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 03:26:43,040 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 03:26:43,223 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:26:43,253 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:43,253 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:43,257 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 03:26:43,262 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 03:26:43,264 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 03:26:43,268 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 03:26:43,630 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-29 03:26:43,980 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:43,980 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:43,984 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 03:26:43,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:43,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:43,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:43,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:43,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:43,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:43,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:43,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,010 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 03:26:44,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:44,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,040 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 03:26:44,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:44,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,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 03:26:44,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:44,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,094 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 03:26:44,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:44,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,119 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 03:26:44,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:44,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,146 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 03:26:44,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:44,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,177 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 03:26:44,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:44,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,202 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 03:26:44,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:44,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:44,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:44,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:44,271 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 03:26:44,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:44,327 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 03:26:44,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:44,370 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 03:26:44,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,407 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 03:26:44,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:44,418 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,443 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 03:26:44,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:44,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:44,455 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:44,480 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 03:26:44,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:44,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:44,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:44,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:44,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:44,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:44,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:44,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:26:44,487 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:44,495 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:26:44,496 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:44,496 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2020-07-29 03:26:44,533 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 03:26:44,536 INFO L393 LassoCheck]: Loop: "call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);" "assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5;" [2020-07-29 03:26:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:26:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:44,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {413#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {413#unseeded} is VALID [2020-07-29 03:26:44,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {413#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {413#unseeded} is VALID [2020-07-29 03:26:44,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {413#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {413#unseeded} is VALID [2020-07-29 03:26:44,592 INFO L280 TraceCheckUtils]: 3: Hoare triple {413#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {413#unseeded} is VALID [2020-07-29 03:26:44,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {413#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {413#unseeded} is VALID [2020-07-29 03:26:44,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {413#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {413#unseeded} is VALID [2020-07-29 03:26:44,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {413#unseeded} assume !(main_~i~1 < main_~array_size~0); {413#unseeded} is VALID [2020-07-29 03:26:44,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {413#unseeded} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {413#unseeded} is VALID [2020-07-29 03:26:44,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {413#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {413#unseeded} is VALID [2020-07-29 03:26:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:44,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {416#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {480#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 03:26:44,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {480#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; {451#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 03:26:44,627 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 03:26:44,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:44,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:44,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:44,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:26:44,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 34 transitions. Complement of second has 7 states. [2020-07-29 03:26:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:44,708 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:44,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:44,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:44,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:44,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2020-07-29 03:26:44,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:44,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,718 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:44,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:44,718 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:44,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:44,720 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:44,720 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:44,721 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:44,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:44,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:26:44,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:26:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:26:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:44,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:44,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:44,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:44,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:44,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:44,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:44,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:44,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:44,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:44,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:44,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:44,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:44,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:44,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:26:44,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:26:44,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:26:44,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:44,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:44,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:26:44,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,736 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:26:44,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:44,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:26:44,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:44,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:44,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:44,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:44,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 26 transitions. [2020-07-29 03:26:44,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:26:44,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:26:44,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-07-29 03:26:44,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:44,743 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:26:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-07-29 03:26:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-07-29 03:26:44,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:44,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand 18 states. [2020-07-29 03:26:44,746 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand 18 states. [2020-07-29 03:26:44,746 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 18 states. [2020-07-29 03:26:44,747 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:44,749 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 03:26:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:26:44,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:44,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:44,750 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 20 states and 26 transitions. [2020-07-29 03:26:44,750 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 20 states and 26 transitions. [2020-07-29 03:26:44,751 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:44,753 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 03:26:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:26:44,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:44,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:44,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:44,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 03:26:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-07-29 03:26:44,756 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 03:26:44,756 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 03:26:44,756 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:44,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-07-29 03:26:44,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:44,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:44,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:44,758 INFO L794 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 520#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 521#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 535#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 527#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 522#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 523#L534-3 assume !(main_~i~1 < main_~array_size~0); 528#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 529#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 530#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 537#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 525#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 526#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 532#L520-3 [2020-07-29 03:26:44,759 INFO L796 eck$LassoCheckResult]: Loop: 532#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 533#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 532#L520-3 [2020-07-29 03:26:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2020-07-29 03:26:44,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:44,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18009859] [2020-07-29 03:26:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {637#true} is VALID [2020-07-29 03:26:44,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {637#true} is VALID [2020-07-29 03:26:44,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {637#true} is VALID [2020-07-29 03:26:44,855 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {639#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:44,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {639#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {639#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:26:44,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {639#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {640#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:44,857 INFO L280 TraceCheckUtils]: 6: Hoare triple {640#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {641#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:26:44,857 INFO L280 TraceCheckUtils]: 7: Hoare triple {641#(<= ULTIMATE.start_main_~array_size~0 1)} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} is VALID [2020-07-29 03:26:44,858 INFO L280 TraceCheckUtils]: 8: Hoare triple {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} is VALID [2020-07-29 03:26:44,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} is VALID [2020-07-29 03:26:44,861 INFO L280 TraceCheckUtils]: 10: Hoare triple {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} is VALID [2020-07-29 03:26:44,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {642#(and (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1) (= 0 ULTIMATE.start_sumOfThirdBytes_~i~0))} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {643#(<= ULTIMATE.start_sumOfThirdBytes_~array_size ULTIMATE.start_sumOfThirdBytes_~i~0)} is VALID [2020-07-29 03:26:44,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {643#(<= ULTIMATE.start_sumOfThirdBytes_~array_size ULTIMATE.start_sumOfThirdBytes_~i~0)} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {638#false} is VALID [2020-07-29 03:26:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:44,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18009859] [2020-07-29 03:26:44,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997828477] [2020-07-29 03:26:44,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:44,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:26:44,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:26:44,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:44,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:45,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {637#true} is VALID [2020-07-29 03:26:45,115 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {637#true} is VALID [2020-07-29 03:26:45,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {637#true} is VALID [2020-07-29 03:26:45,116 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {656#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:45,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {656#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {656#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:26:45,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {656#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {640#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:26:45,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {640#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {641#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:26:45,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {641#(<= ULTIMATE.start_main_~array_size~0 1)} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} is VALID [2020-07-29 03:26:45,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} is VALID [2020-07-29 03:26:45,125 INFO L280 TraceCheckUtils]: 9: Hoare triple {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} is VALID [2020-07-29 03:26:45,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} is VALID [2020-07-29 03:26:45,127 INFO L280 TraceCheckUtils]: 11: Hoare triple {669#(and (<= 0 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {682#(and (<= 1 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} is VALID [2020-07-29 03:26:45,127 INFO L280 TraceCheckUtils]: 12: Hoare triple {682#(and (<= 1 ULTIMATE.start_sumOfThirdBytes_~i~0) (<= ULTIMATE.start_sumOfThirdBytes_~array_size 1))} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {638#false} is VALID [2020-07-29 03:26:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:45,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:45,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 03:26:45,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403365047] [2020-07-29 03:26:45,130 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2020-07-29 03:26:45,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418348943] [2020-07-29 03:26:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,140 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:45,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:26:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:26:45,213 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-07-29 03:26:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:45,465 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 03:26:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:26:45,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:26:45,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:45,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-07-29 03:26:45,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:45,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2020-07-29 03:26:45,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:26:45,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:26:45,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2020-07-29 03:26:45,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:45,502 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-29 03:26:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2020-07-29 03:26:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 03:26:45,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:45,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 25 transitions. Second operand 20 states. [2020-07-29 03:26:45,504 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 25 transitions. Second operand 20 states. [2020-07-29 03:26:45,504 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 20 states. [2020-07-29 03:26:45,504 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:45,506 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-29 03:26:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-29 03:26:45,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:45,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:45,506 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 25 transitions. [2020-07-29 03:26:45,507 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 25 transitions. [2020-07-29 03:26:45,507 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:45,509 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-29 03:26:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-29 03:26:45,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:45,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:45,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:45,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:26:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-07-29 03:26:45,511 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-29 03:26:45,511 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-29 03:26:45,511 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:45,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2020-07-29 03:26:45,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:45,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:45,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:45,512 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:45,512 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:45,513 INFO L794 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 730#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 731#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 744#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 732#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 728#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 729#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 733#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 746#L534-3 assume !(main_~i~1 < main_~array_size~0); 737#L534-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 738#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 739#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 747#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 735#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 736#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; 741#L520-3 [2020-07-29 03:26:45,513 INFO L796 eck$LassoCheckResult]: Loop: 741#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 742#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 741#L520-3 [2020-07-29 03:26:45,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2020-07-29 03:26:45,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733990605] [2020-07-29 03:26:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2020-07-29 03:26:45,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103168699] [2020-07-29 03:26:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:45,555 INFO L82 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2020-07-29 03:26:45,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:45,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666402069] [2020-07-29 03:26:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:45,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:45,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:46,000 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2020-07-29 03:26:46,167 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:46,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:46,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:46,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:46,167 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:46,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:46,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:46,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration6_Lasso [2020-07-29 03:26:46,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:46,168 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:46,198 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 03:26:46,381 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-07-29 03:26:46,448 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:46,452 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 03:26:46,459 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 03:26:46,464 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 03:26:46,469 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 03:26:46,473 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 03:26:46,476 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 03:26:46,482 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 03:26:46,485 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 03:26:46,487 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 03:26:46,490 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 03:26:46,493 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 03:26:46,496 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 03:26:46,499 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 03:26:46,503 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 03:26:46,506 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 03:26:46,510 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 03:26:46,513 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 03:26:46,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:47,293 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:47,293 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,298 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 03:26:47,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,319 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:47,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,367 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,389 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 03:26:47,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:47,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:26:47,397 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:47,401 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:26:47,401 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:47,401 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2020-07-29 03:26:47,449 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:26:47,451 INFO L393 LassoCheck]: Loop: "call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);" "assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5;" [2020-07-29 03:26:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:26:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {864#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {864#unseeded} is VALID [2020-07-29 03:26:47,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {864#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {864#unseeded} is VALID [2020-07-29 03:26:47,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {864#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {864#unseeded} is VALID [2020-07-29 03:26:47,500 INFO L280 TraceCheckUtils]: 3: Hoare triple {864#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {864#unseeded} is VALID [2020-07-29 03:26:47,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {864#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {864#unseeded} is VALID [2020-07-29 03:26:47,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {864#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {864#unseeded} is VALID [2020-07-29 03:26:47,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {864#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {864#unseeded} is VALID [2020-07-29 03:26:47,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {864#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {864#unseeded} is VALID [2020-07-29 03:26:47,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {864#unseeded} assume !(main_~i~1 < main_~array_size~0); {864#unseeded} is VALID [2020-07-29 03:26:47,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {864#unseeded} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {864#unseeded} is VALID [2020-07-29 03:26:47,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {864#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {864#unseeded} is VALID [2020-07-29 03:26:47,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {864#unseeded} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {864#unseeded} is VALID [2020-07-29 03:26:47,504 INFO L280 TraceCheckUtils]: 12: Hoare triple {864#unseeded} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {864#unseeded} is VALID [2020-07-29 03:26:47,505 INFO L280 TraceCheckUtils]: 13: Hoare triple {864#unseeded} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {864#unseeded} is VALID [2020-07-29 03:26:47,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {864#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {864#unseeded} is VALID [2020-07-29 03:26:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {867#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {959#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 03:26:47,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; {912#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 03:26:47,537 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 03:26:47,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:47,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:47,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:47,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:26:47,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 31 transitions. Complement of second has 7 states. [2020-07-29 03:26:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:47,607 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:47,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:47,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2020-07-29 03:26:47,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,613 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:47,614 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:47,614 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:47,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,615 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:47,615 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 31 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:47,615 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,633 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 03:26:47,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,635 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {864#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {864#unseeded} is VALID [2020-07-29 03:26:47,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {864#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {864#unseeded} is VALID [2020-07-29 03:26:47,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {864#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {864#unseeded} is VALID [2020-07-29 03:26:47,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {864#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {864#unseeded} is VALID [2020-07-29 03:26:47,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {864#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {864#unseeded} is VALID [2020-07-29 03:26:47,688 INFO L280 TraceCheckUtils]: 5: Hoare triple {864#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {864#unseeded} is VALID [2020-07-29 03:26:47,688 INFO L280 TraceCheckUtils]: 6: Hoare triple {864#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {864#unseeded} is VALID [2020-07-29 03:26:47,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {864#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {864#unseeded} is VALID [2020-07-29 03:26:47,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {864#unseeded} assume !(main_~i~1 < main_~array_size~0); {864#unseeded} is VALID [2020-07-29 03:26:47,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {864#unseeded} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {864#unseeded} is VALID [2020-07-29 03:26:47,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {864#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {864#unseeded} is VALID [2020-07-29 03:26:47,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {864#unseeded} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {864#unseeded} is VALID [2020-07-29 03:26:47,691 INFO L280 TraceCheckUtils]: 12: Hoare triple {864#unseeded} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {864#unseeded} is VALID [2020-07-29 03:26:47,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {864#unseeded} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {864#unseeded} is VALID [2020-07-29 03:26:47,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {864#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {864#unseeded} is VALID [2020-07-29 03:26:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {867#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {1045#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 03:26:47,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {1045#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; {912#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 03:26:47,725 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 03:26:47,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:47,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:47,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:47,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:26:47,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 31 transitions. Complement of second has 7 states. [2020-07-29 03:26:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:47,777 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:47,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:47,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2020-07-29 03:26:47,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,779 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:47,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:47,779 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:47,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,780 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:47,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 31 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:47,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:47,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 31 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,790 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 03:26:47,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,791 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {864#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {864#unseeded} is VALID [2020-07-29 03:26:47,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {864#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {864#unseeded} is VALID [2020-07-29 03:26:47,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {864#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {864#unseeded} is VALID [2020-07-29 03:26:47,849 INFO L280 TraceCheckUtils]: 3: Hoare triple {864#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; {864#unseeded} is VALID [2020-07-29 03:26:47,849 INFO L280 TraceCheckUtils]: 4: Hoare triple {864#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {864#unseeded} is VALID [2020-07-29 03:26:47,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {864#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {864#unseeded} is VALID [2020-07-29 03:26:47,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {864#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; {864#unseeded} is VALID [2020-07-29 03:26:47,852 INFO L280 TraceCheckUtils]: 7: Hoare triple {864#unseeded} main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; {864#unseeded} is VALID [2020-07-29 03:26:47,852 INFO L280 TraceCheckUtils]: 8: Hoare triple {864#unseeded} assume !(main_~i~1 < main_~array_size~0); {864#unseeded} is VALID [2020-07-29 03:26:47,853 INFO L280 TraceCheckUtils]: 9: Hoare triple {864#unseeded} sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; {864#unseeded} is VALID [2020-07-29 03:26:47,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {864#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {864#unseeded} is VALID [2020-07-29 03:26:47,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {864#unseeded} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {864#unseeded} is VALID [2020-07-29 03:26:47,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {864#unseeded} assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; {864#unseeded} is VALID [2020-07-29 03:26:47,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {864#unseeded} sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; {864#unseeded} is VALID [2020-07-29 03:26:47,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {864#unseeded} assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; {864#unseeded} is VALID [2020-07-29 03:26:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {867#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))} call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); {1131#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} is VALID [2020-07-29 03:26:47,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {1131#(and (<= |ULTIMATE.start_sumOfThirdBytes_#t~mem3| (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset) oldRank0))} assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; {912#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset))) unseeded)} is VALID [2020-07-29 03:26:47,891 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 03:26:47,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:47,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:47,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,906 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 2 loop predicates [2020-07-29 03:26:47,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:26:47,980 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 27 states and 33 transitions. Complement of second has 6 states. [2020-07-29 03:26:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:47,980 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:47,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:47,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:47,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:47,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2020-07-29 03:26:47,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:47,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:47,982 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:47,982 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:47,982 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:47,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:47,983 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:47,983 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 33 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:47,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:47,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:47,984 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:47,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:26:47,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:26:47,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:26:47,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:47,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:47,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:26:47,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:47,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,990 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 03:26:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:26:47,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:26:47,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:47,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:47,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. cyclomatic complexity: 10 [2020-07-29 03:26:47,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:47,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2020-07-29 03:26:47,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:26:47,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:26:47,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:26:47,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:47,994 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:47,994 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:47,994 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:47,994 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:26:47,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:26:47,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:47,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:48,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:48 BoogieIcfgContainer [2020-07-29 03:26:48,001 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:48,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:48,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:48,002 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:48,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:36" (3/4) ... [2020-07-29 03:26:48,014 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:26:48,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:48,016 INFO L168 Benchmark]: Toolchain (without parser) took 12349.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.5 MB). Free memory was 956.2 MB in the beginning and 1.4 GB in the end (delta: -420.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:48,017 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:48,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:48,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.25 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:48,019 INFO L168 Benchmark]: Boogie Preprocessor took 33.59 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 03:26:48,019 INFO L168 Benchmark]: RCFGBuilder took 420.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:48,020 INFO L168 Benchmark]: BuchiAutomizer took 11229.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -293.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:48,020 INFO L168 Benchmark]: Witness Printer took 12.69 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:48,024 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.25 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 420.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11229.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -293.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 12.69 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + array_size and consists of 5 locations. One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 92 SDtfs, 112 SDslu, 75 SDs, 0 SdLazy, 100 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital143 mio100 ax113 hnf98 lsp81 ukn82 mio100 lsp60 div100 bol100 ite100 ukn100 eq180 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms 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...