./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.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 e71cee6f8bfbdef490f31ccfbc80e5cb950e3b6d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:44:40,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:44:40,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:44:40,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:44:40,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:44:40,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:44:40,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:44:40,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:44:40,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:44:40,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:44:40,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:44:40,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:44:40,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:44:40,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:44:40,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:44:40,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:44:40,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:44:40,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:44:40,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:44:40,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:44:40,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:44:40,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:44:40,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:44:40,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:44:40,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:44:40,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:44:40,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:44:40,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:44:40,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:44:40,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:44:40,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:44:40,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:44:40,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:44:40,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:44:40,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:44:40,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:44:40,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:44:40,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:44:40,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:44:40,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:44:40,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:44:40,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:44:40,430 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:44:40,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:44:40,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:44:40,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:44:40,432 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:44:40,432 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:44:40,432 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:44:40,432 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:44:40,432 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:44:40,433 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:44:40,433 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:44:40,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:44:40,433 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:44:40,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:44:40,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:44:40,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:44:40,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:44:40,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:44:40,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:44:40,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:44:40,435 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:44:40,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:44:40,435 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:44:40,435 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:44:40,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:44:40,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:44:40,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:44:40,436 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:44:40,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:44:40,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:44:40,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:44:40,443 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:44:40,444 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:44:40,444 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 -> e71cee6f8bfbdef490f31ccfbc80e5cb950e3b6d [2020-10-20 06:44:40,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:44:40,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:44:40,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:44:40,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:44:40,661 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:44:40,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2020-10-20 06:44:40,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132738a34/51914a563b394c098437373ac1300923/FLAG152f45b01 [2020-10-20 06:44:41,241 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:44:41,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2020-10-20 06:44:41,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132738a34/51914a563b394c098437373ac1300923/FLAG152f45b01 [2020-10-20 06:44:41,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132738a34/51914a563b394c098437373ac1300923 [2020-10-20 06:44:41,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:44:41,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:44:41,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:44:41,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:44:41,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:44:41,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17bfc70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41, skipping insertion in model container [2020-10-20 06:44:41,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:44:41,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:44:41,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:44:41,897 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:44:41,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:44:41,931 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:44:41,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41 WrapperNode [2020-10-20 06:44:41,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:44:41,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:44:41,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:44:41,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:44:41,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:44:41,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:44:41,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:44:41,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:44:41,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... [2020-10-20 06:44:41,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:44:41,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:44:41,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:44:41,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:44:41,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:44:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:44:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:44:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:44:42,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:44:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:44:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:44:42,281 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:44:42,282 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 06:44:42,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:44:42 BoogieIcfgContainer [2020-10-20 06:44:42,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:44:42,285 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:44:42,285 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:44:42,289 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:44:42,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:44:42,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:44:41" (1/3) ... [2020-10-20 06:44:42,291 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@354b6e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:44:42, skipping insertion in model container [2020-10-20 06:44:42,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:44:42,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:44:41" (2/3) ... [2020-10-20 06:44:42,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@354b6e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:44:42, skipping insertion in model container [2020-10-20 06:44:42,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:44:42,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:44:42" (3/3) ... [2020-10-20 06:44:42,294 INFO L373 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2020-10-20 06:44:42,387 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:44:42,388 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:44:42,388 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:44:42,388 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:44:42,388 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:44:42,388 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:44:42,388 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:44:42,389 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:44:42,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-20 06:44:42,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 06:44:42,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:42,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:42,455 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:44:42,456 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:42,456 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:44:42,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-20 06:44:42,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 06:44:42,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:42,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:42,465 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:44:42,465 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:44:42,478 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 9#L-1true havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 3#L18-3true [2020-10-20 06:44:42,478 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 4#L18-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 3#L18-3true [2020-10-20 06:44:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:44:42,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:42,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010178501] [2020-10-20 06:44:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:42,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:42,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:42,646 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 06:44:42,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:42,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31568525] [2020-10-20 06:44:42,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:42,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:42,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:42,667 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 06:44:42,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:42,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109013466] [2020-10-20 06:44:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:42,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:42,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:42,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:42,971 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-20 06:44:43,080 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:44:43,081 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:44:43,081 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:44:43,081 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:44:43,081 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:44:43,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:44:43,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:44:43,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2020-10-20 06:44:43,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:44:43,083 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:44:43,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:44:43,563 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:44:43,569 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-10-20 06:44:43,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:43,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:43,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:43,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:44:43,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:43,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:43,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,639 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-10-20 06:44:43,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:43,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,711 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-10-20 06:44:43,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:43,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:43,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:44:43,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:43,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:43,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:43,837 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-10-20 06:44:43,873 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:43,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:43,895 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) [2020-10-20 06:44:43,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:43,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:43,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:43,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:43,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:43,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:43,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:43,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:44,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:44,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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:44,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:44,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:44,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:44,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:44,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:44,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:44,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:44,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:44,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:44,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:44,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:44:44,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:44,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:44,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:44,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:44:44,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:44:44,094 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) [2020-10-20 06:44:44,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:44,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:44,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:44,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:44,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:44,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:44,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:44,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:44,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:44:44,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:44,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:44,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:44,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:44,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:44,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:44,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44: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 [2020-10-20 06:44:44,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:44:44,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:44:44,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:44:44,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:44:44,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:44:44,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:44:44,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:44:44,277 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:44:44,277 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:44:44,290 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:44:44,293 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:44:44,293 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:44:44,294 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2020-10-20 06:44:44,356 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 06:44:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:44,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:44:44,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:44,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:44:44,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:44:44,509 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-10-20 06:44:44,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2020-10-20 06:44:44,567 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2020-10-20 06:44:44,568 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-10-20 06:44:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:44:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-10-20 06:44:44,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 06:44:44,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:44,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 06:44:44,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:44,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:44:44,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:44:44,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2020-10-20 06:44:44,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:44:44,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2020-10-20 06:44:44,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:44:44,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 06:44:44,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-10-20 06:44:44,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:44:44,587 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:44:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-10-20 06:44:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-20 06:44:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:44:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-20 06:44:44,619 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:44:44,619 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:44:44,619 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:44:44,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-20 06:44:44,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:44:44,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:44,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:44,621 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:44:44,621 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:44:44,622 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 125#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 118#L18-3 assume !(main_~i~0 < 100000); 119#L18-4 main_~i~0 := 0; 122#L22-3 [2020-10-20 06:44:44,622 INFO L796 eck$LassoCheckResult]: Loop: 122#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 123#L13 assume !(0 == __VERIFIER_assert_~cond); 126#L13-3 havoc main_#t~mem5; 127#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 124#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 122#L22-3 [2020-10-20 06:44:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 06:44:44,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:44,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273698180] [2020-10-20 06:44:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:44:44,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273698180] [2020-10-20 06:44:44,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:44:44,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:44:44,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128165641] [2020-10-20 06:44:44,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash 51965533, now seen corresponding path program 1 times [2020-10-20 06:44:44,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:44,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71314682] [2020-10-20 06:44:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:44,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:44,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:44,912 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2020-10-20 06:44:44,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:44:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:44:44,921 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 06:44:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:44,961 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-10-20 06:44:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:44:44,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-10-20 06:44:44,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:44,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 19 transitions. [2020-10-20 06:44:44,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:44:44,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:44:44,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-10-20 06:44:44,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:44:44,966 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:44:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-10-20 06:44:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-10-20 06:44:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 06:44:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-10-20 06:44:44,969 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 06:44:44,969 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 06:44:44,969 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:44:44,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-10-20 06:44:44,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:44,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:44,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:44,971 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:44:44,972 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:44:44,972 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 159#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 160#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 161#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 162#L18-3 assume !(main_~i~0 < 100000); 163#L18-4 main_~i~0 := 0; 169#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 173#L13 assume !(0 == __VERIFIER_assert_~cond); 172#L13-3 havoc main_#t~mem5; 170#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 171#L22-2 [2020-10-20 06:44:44,972 INFO L796 eck$LassoCheckResult]: Loop: 171#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 168#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 167#L13 assume !(0 == __VERIFIER_assert_~cond); 164#L13-3 havoc main_#t~mem5; 165#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 171#L22-2 [2020-10-20 06:44:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1436013086, now seen corresponding path program 1 times [2020-10-20 06:44:44,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:44,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248239464] [2020-10-20 06:44:44,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:44:45,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248239464] [2020-10-20 06:44:45,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52096413] [2020-10-20 06:44:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:44:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:45,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:44:45,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:44:45,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:45,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 06:44:45,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875596589] [2020-10-20 06:44:45,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 2 times [2020-10-20 06:44:45,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:45,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265268182] [2020-10-20 06:44:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:45,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:45,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:45,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:45,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:45,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:44:45,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:44:45,268 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-20 06:44:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:45,311 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-10-20 06:44:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:44:45,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2020-10-20 06:44:45,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:45,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2020-10-20 06:44:45,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 06:44:45,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 06:44:45,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2020-10-20 06:44:45,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:44:45,315 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 06:44:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2020-10-20 06:44:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-10-20 06:44:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:44:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-20 06:44:45,319 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 06:44:45,319 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 06:44:45,319 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:44:45,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-10-20 06:44:45,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:45,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:45,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:45,322 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 06:44:45,322 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:44:45,322 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 233#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 234#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 235#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 236#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 237#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 248#L18-3 assume !(main_~i~0 < 100000); 244#L18-4 main_~i~0 := 0; 242#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 243#L13 assume !(0 == __VERIFIER_assert_~cond); 254#L13-3 havoc main_#t~mem5; 253#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 246#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 247#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 241#L13 assume !(0 == __VERIFIER_assert_~cond); 238#L13-3 havoc main_#t~mem5; 239#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 245#L22-2 [2020-10-20 06:44:45,323 INFO L796 eck$LassoCheckResult]: Loop: 245#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 252#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 251#L13 assume !(0 == __VERIFIER_assert_~cond); 250#L13-3 havoc main_#t~mem5; 249#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 245#L22-2 [2020-10-20 06:44:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash 464413856, now seen corresponding path program 1 times [2020-10-20 06:44:45,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:45,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233151940] [2020-10-20 06:44:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 06:44:45,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233151940] [2020-10-20 06:44:45,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620630882] [2020-10-20 06:44:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:44:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:45,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:44:45,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 06:44:45,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:45,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 06:44:45,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46855487] [2020-10-20 06:44:45,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 3 times [2020-10-20 06:44:45,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:45,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800658710] [2020-10-20 06:44:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:45,449 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:45,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:45,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:45,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:45,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:44:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:44:45,615 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-10-20 06:44:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:45,662 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-10-20 06:44:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:44:45,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2020-10-20 06:44:45,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:45,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2020-10-20 06:44:45,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 06:44:45,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 06:44:45,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2020-10-20 06:44:45,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:44:45,666 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-10-20 06:44:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2020-10-20 06:44:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-20 06:44:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 06:44:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-10-20 06:44:45,670 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-10-20 06:44:45,671 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-10-20 06:44:45,671 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:44:45,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2020-10-20 06:44:45,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:45,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:45,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:45,673 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2020-10-20 06:44:45,673 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:44:45,674 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 347#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 343#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 344#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 345#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 346#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 350#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 360#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 359#L18-3 assume !(main_~i~0 < 100000); 354#L18-4 main_~i~0 := 0; 355#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 371#L13 assume !(0 == __VERIFIER_assert_~cond); 370#L13-3 havoc main_#t~mem5; 369#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 358#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 353#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 352#L13 assume !(0 == __VERIFIER_assert_~cond); 348#L13-3 havoc main_#t~mem5; 349#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 365#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 368#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 367#L13 assume !(0 == __VERIFIER_assert_~cond); 366#L13-3 havoc main_#t~mem5; 356#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 357#L22-2 [2020-10-20 06:44:45,674 INFO L796 eck$LassoCheckResult]: Loop: 357#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 364#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 363#L13 assume !(0 == __VERIFIER_assert_~cond); 362#L13-3 havoc main_#t~mem5; 361#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 357#L22-2 [2020-10-20 06:44:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1190007842, now seen corresponding path program 2 times [2020-10-20 06:44:45,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:45,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667673474] [2020-10-20 06:44:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-20 06:44:45,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667673474] [2020-10-20 06:44:45,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197788480] [2020-10-20 06:44:45,729 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:44:45,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:44:45,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:44:45,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:44:45,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-20 06:44:45,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:44:45,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 06:44:45,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586031074] [2020-10-20 06:44:45,811 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:45,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 4 times [2020-10-20 06:44:45,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:45,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729576361] [2020-10-20 06:44:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:45,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:45,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:45,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:45,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:44:45,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:44:45,948 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-10-20 06:44:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:46,000 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-10-20 06:44:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:44:46,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2020-10-20 06:44:46,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:46,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2020-10-20 06:44:46,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 06:44:46,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-20 06:44:46,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2020-10-20 06:44:46,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:44:46,004 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-10-20 06:44:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2020-10-20 06:44:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-10-20 06:44:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 06:44:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-10-20 06:44:46,007 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-10-20 06:44:46,008 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-10-20 06:44:46,008 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:44:46,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2020-10-20 06:44:46,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:44:46,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:44:46,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:44:46,010 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2020-10-20 06:44:46,010 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:44:46,010 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 489#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 490#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 491#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 492#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 493#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 497#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 507#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 506#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 505#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 504#L18-3 assume !(main_~i~0 < 100000); 500#L18-4 main_~i~0 := 0; 501#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 524#L13 assume !(0 == __VERIFIER_assert_~cond); 523#L13-3 havoc main_#t~mem5; 522#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 503#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 499#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 498#L13 assume !(0 == __VERIFIER_assert_~cond); 494#L13-3 havoc main_#t~mem5; 495#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 502#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 521#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 520#L13 assume !(0 == __VERIFIER_assert_~cond); 519#L13-3 havoc main_#t~mem5; 518#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 517#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 516#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 515#L13 assume !(0 == __VERIFIER_assert_~cond); 514#L13-3 havoc main_#t~mem5; 513#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 509#L22-2 [2020-10-20 06:44:46,010 INFO L796 eck$LassoCheckResult]: Loop: 509#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 512#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 511#L13 assume !(0 == __VERIFIER_assert_~cond); 510#L13-3 havoc main_#t~mem5; 508#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 509#L22-2 [2020-10-20 06:44:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash -913629028, now seen corresponding path program 3 times [2020-10-20 06:44:46,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:46,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604380344] [2020-10-20 06:44:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:44:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-20 06:44:46,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604380344] [2020-10-20 06:44:46,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296267462] [2020-10-20 06:44:46,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:44:46,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-20 06:44:46,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:44:46,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:44:46,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:44:46,174 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-10-20 06:44:46,175 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:44:46,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:44:46,178 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:44:46,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-10-20 06:44:46,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:44:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-20 06:44:46,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 06:44:46,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-10-20 06:44:46,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680119910] [2020-10-20 06:44:46,231 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:44:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:44:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 5 times [2020-10-20 06:44:46,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:44:46,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972312179] [2020-10-20 06:44:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:44:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:46,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:44:46,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:44:46,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:44:46,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:44:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:44:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:44:46,392 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-20 06:44:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:44:46,433 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-10-20 06:44:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:44:46,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2020-10-20 06:44:46,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:44:46,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2020-10-20 06:44:46,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:44:46,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:44:46,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:44:46,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:44:46,435 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:44:46,435 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:44:46,435 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:44:46,435 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:44:46,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:44:46,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:44:46,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:44:46,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:44:46 BoogieIcfgContainer [2020-10-20 06:44:46,443 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:44:46,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:44:46,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:44:46,444 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:44:46,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:44:42" (3/4) ... [2020-10-20 06:44:46,449 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:44:46,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:44:46,451 INFO L168 Benchmark]: Toolchain (without parser) took 4880.95 ms. Allocated memory was 32.5 MB in the beginning and 66.6 MB in the end (delta: 34.1 MB). Free memory was 8.6 MB in the beginning and 36.7 MB in the end (delta: -28.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,452 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 29.9 MB. Free memory was 12.0 MB in the beginning and 12.0 MB in the end (delta: 40.1 kB). Peak memory consumption was 40.1 kB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.06 ms. Allocated memory was 32.5 MB in the beginning and 41.9 MB in the end (delta: 9.4 MB). Free memory was 7.8 MB in the beginning and 21.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.86 ms. Allocated memory is still 41.9 MB. Free memory was 21.4 MB in the beginning and 19.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,455 INFO L168 Benchmark]: Boogie Preprocessor took 23.98 ms. Allocated memory is still 41.9 MB. Free memory was 19.6 MB in the beginning and 18.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,456 INFO L168 Benchmark]: RCFGBuilder took 291.25 ms. Allocated memory is still 41.9 MB. Free memory was 18.3 MB in the beginning and 16.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 8.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,457 INFO L168 Benchmark]: BuchiAutomizer took 4158.64 ms. Allocated memory was 41.9 MB in the beginning and 66.6 MB in the end (delta: 24.6 MB). Free memory was 16.3 MB in the beginning and 37.5 MB in the end (delta: -21.2 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,458 INFO L168 Benchmark]: Witness Printer took 5.26 ms. Allocated memory is still 66.6 MB. Free memory was 37.5 MB in the beginning and 36.7 MB in the end (delta: 835.1 kB). Peak memory consumption was 835.1 kB. Max. memory is 14.3 GB. [2020-10-20 06:44:46,462 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 29.9 MB. Free memory was 12.0 MB in the beginning and 12.0 MB in the end (delta: 40.1 kB). Peak memory consumption was 40.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 356.06 ms. Allocated memory was 32.5 MB in the beginning and 41.9 MB in the end (delta: 9.4 MB). Free memory was 7.8 MB in the beginning and 21.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 35.86 ms. Allocated memory is still 41.9 MB. Free memory was 21.4 MB in the beginning and 19.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 23.98 ms. Allocated memory is still 41.9 MB. Free memory was 19.6 MB in the beginning and 18.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 291.25 ms. Allocated memory is still 41.9 MB. Free memory was 18.3 MB in the beginning and 16.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 8.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 4158.64 ms. Allocated memory was 41.9 MB in the beginning and 66.6 MB in the end (delta: 24.6 MB). Free memory was 16.3 MB in the beginning and 37.5 MB in the end (delta: -21.2 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.3 GB. * Witness Printer took 5.26 ms. Allocated memory is still 66.6 MB. Free memory was 37.5 MB in the beginning and 36.7 MB in the end (delta: 835.1 kB). Peak memory consumption was 835.1 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 43 SDtfs, 59 SDslu, 48 SDs, 0 SdLazy, 131 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp94 ukn56 mio100 lsp41 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms 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...