./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer --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 54e32ac14491e98c150c8fd937f55676029a26c7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:38:20,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:38:20,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:38:20,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:38:20,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:38:20,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:38:20,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:38:20,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:38:20,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:38:20,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:38:20,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:38:20,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:38:20,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:38:20,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:38:20,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:38:20,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:38:20,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:38:20,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:38:20,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:38:20,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:38:20,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:38:20,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:38:20,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:38:20,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:38:20,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:38:20,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:38:20,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:38:20,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:38:20,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:38:20,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:38:20,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:38:20,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:38:20,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:38:20,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:38:20,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:38:20,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:38:20,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:38:20,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:38:20,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:38:20,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:38:20,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:38:20,698 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 14:38:20,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:38:20,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:38:20,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:38:20,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:38:20,709 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:38:20,709 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 14:38:20,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:38:20,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:38:20,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 14:38:20,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:38:20,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:38:20,712 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 14:38:20,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:38:20,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:38:20,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:38:20,712 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 14:38:20,713 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 14:38:20,713 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer 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 -> 54e32ac14491e98c150c8fd937f55676029a26c7 [2019-12-07 14:38:20,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:38:20,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:38:20,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:38:20,820 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:38:20,820 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:38:20,821 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2019-12-07 14:38:20,857 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/data/0b927213a/39fca480e6ec48ed9554f19651ec2eec/FLAGcd82984bb [2019-12-07 14:38:21,253 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:38:21,254 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2019-12-07 14:38:21,258 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/data/0b927213a/39fca480e6ec48ed9554f19651ec2eec/FLAGcd82984bb [2019-12-07 14:38:21,266 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/data/0b927213a/39fca480e6ec48ed9554f19651ec2eec [2019-12-07 14:38:21,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:38:21,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:38:21,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:38:21,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:38:21,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:38:21,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119a7e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21, skipping insertion in model container [2019-12-07 14:38:21,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:38:21,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:38:21,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:38:21,390 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:38:21,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:38:21,449 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:38:21,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21 WrapperNode [2019-12-07 14:38:21,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:38:21,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:38:21,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:38:21,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:38:21,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:38:21,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:38:21,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:38:21,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:38:21,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... [2019-12-07 14:38:21,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:38:21,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:38:21,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:38:21,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:38:21,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:38:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:38:21,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:38:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:38:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:38:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:38:21,647 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:38:21,648 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:38:21,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:38:21 BoogieIcfgContainer [2019-12-07 14:38:21,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:38:21,649 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 14:38:21,649 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 14:38:21,651 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 14:38:21,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:38:21,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 02:38:21" (1/3) ... [2019-12-07 14:38:21,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29533063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:38:21, skipping insertion in model container [2019-12-07 14:38:21,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:38:21,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:38:21" (2/3) ... [2019-12-07 14:38:21,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29533063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:38:21, skipping insertion in model container [2019-12-07 14:38:21,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:38:21,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:38:21" (3/3) ... [2019-12-07 14:38:21,654 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2019-12-07 14:38:21,682 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 14:38:21,682 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 14:38:21,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 14:38:21,682 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:38:21,682 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:38:21,682 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 14:38:21,682 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:38:21,682 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 14:38:21,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-12-07 14:38:21,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 14:38:21,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:21,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:21,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 14:38:21,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 14:38:21,708 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 14:38:21,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-12-07 14:38:21,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 14:38:21,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:21,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:21,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 14:38:21,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 14:38:21,715 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, 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; 17#L7-3true [2019-12-07 14:38:21,715 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 3#L7-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 17#L7-3true [2019-12-07 14:38:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 14:38:21,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:21,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878874254] [2019-12-07 14:38:21,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:21,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 14:38:21,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:21,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650206008] [2019-12-07 14:38:21,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:21,813 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:21,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 14:38:21,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:21,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128040098] [2019-12-07 14:38:21,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:21,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:21,956 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:38:21,957 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:38:21,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:38:21,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:38:21,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:38:21,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:21,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:38:21,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:38:21,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2019-12-07 14:38:21,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:38:21,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:38:21,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:38:22,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:38:22,108 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:22,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:38:22,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:38:22,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:38:22,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:38:22,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:38:22,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:38:22,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:38:22,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:22,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:38:22,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:38:22,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:38:22,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:38:22,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:38:22,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:38:22,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:38:22,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:22,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:38:22,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:38:22,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:38:22,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:38:22,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:38:22,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:38:22,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:38:22,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:22,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:38:22,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:38:22,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:38:22,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:38:22,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:38:22,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:38:22,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:38:22,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:38:22,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:22,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:38:22,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:38:22,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:38:22,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:38:22,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:38:22,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:38:22,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:38:22,169 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:38:22,185 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-12-07 14:38:22,185 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:38:22,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:38:22,192 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 14:38:22,192 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:38:22,193 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-12-07 14:38:22,200 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-12-07 14:38:22,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:38:22,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:38:22,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:22,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 14:38:22,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-12-07 14:38:22,295 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 29 states and 41 transitions. Complement of second has 8 states. [2019-12-07 14:38:22,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 14:38:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 14:38:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-12-07 14:38:22,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 14:38:22,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:38:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 14:38:22,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:38:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 14:38:22,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:38:22,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2019-12-07 14:38:22,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 14:38:22,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2019-12-07 14:38:22,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-12-07 14:38:22,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 14:38:22,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-12-07 14:38:22,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:38:22,309 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 14:38:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-12-07 14:38:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-07 14:38:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 14:38:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-12-07 14:38:22,334 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 14:38:22,334 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 14:38:22,334 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 14:38:22,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-12-07 14:38:22,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-12-07 14:38:22,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:22,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:22,336 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 14:38:22,336 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:38:22,336 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 88#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, 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; 89#L7-3 assume !(main_~i~0 < 100000); 98#L7-4 main_~i~0 := 0; 97#L11-3 [2019-12-07 14:38:22,336 INFO L796 eck$LassoCheckResult]: Loop: 97#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 96#L2 assume !(0 == __VERIFIER_assert_~cond); 90#L2-3 havoc main_#t~mem2; 91#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 99#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 97#L11-3 [2019-12-07 14:38:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-12-07 14:38:22,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113918110] [2019-12-07 14:38:22,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:22,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113918110] [2019-12-07 14:38:22,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:22,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:38:22,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508758684] [2019-12-07 14:38:22,375 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:38:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2019-12-07 14:38:22,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145788609] [2019-12-07 14:38:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:22,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:22,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:38:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:38:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:38:22,512 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-12-07 14:38:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:22,534 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-12-07 14:38:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:38:22,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-12-07 14:38:22,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:22,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2019-12-07 14:38:22,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-12-07 14:38:22,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-12-07 14:38:22,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-12-07 14:38:22,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:38:22,537 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 14:38:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-12-07 14:38:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-12-07 14:38:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 14:38:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-12-07 14:38:22,539 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-12-07 14:38:22,539 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-12-07 14:38:22,539 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 14:38:22,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-12-07 14:38:22,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:22,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:22,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:22,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:22,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:38:22,540 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, 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; 126#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 129#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 130#L7-3 assume !(main_~i~0 < 100000); 134#L7-4 main_~i~0 := 0; 135#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 139#L2 assume !(0 == __VERIFIER_assert_~cond); 138#L2-3 havoc main_#t~mem2; 136#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 137#L11-2 [2019-12-07 14:38:22,540 INFO L796 eck$LassoCheckResult]: Loop: 137#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 133#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 132#L2 assume !(0 == __VERIFIER_assert_~cond); 127#L2-3 havoc main_#t~mem2; 128#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 137#L11-2 [2019-12-07 14:38:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2019-12-07 14:38:22,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219946822] [2019-12-07 14:38:22,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:22,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219946822] [2019-12-07 14:38:22,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053026105] [2019-12-07 14:38:22,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:38:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:38:22,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:22,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:38:22,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 14:38:22,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072135744] [2019-12-07 14:38:22,598 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:38:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2019-12-07 14:38:22,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305826933] [2019-12-07 14:38:22,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:22,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:22,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:38:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:38:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:38:22,717 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-12-07 14:38:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:22,742 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-12-07 14:38:22,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:38:22,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-12-07 14:38:22,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:22,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 14:38:22,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 14:38:22,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-12-07 14:38:22,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-12-07 14:38:22,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:38:22,745 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 14:38:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-12-07 14:38:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-12-07 14:38:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 14:38:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-12-07 14:38:22,747 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-12-07 14:38:22,747 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-12-07 14:38:22,747 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 14:38:22,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-12-07 14:38:22,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:22,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:22,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:22,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 14:38:22,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:38:22,749 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 201#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, 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; 202#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 212#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 213#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 203#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 204#L7-3 assume !(main_~i~0 < 100000); 208#L7-4 main_~i~0 := 0; 209#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 220#L2 assume !(0 == __VERIFIER_assert_~cond); 219#L2-3 havoc main_#t~mem2; 218#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 211#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 207#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 206#L2 assume !(0 == __VERIFIER_assert_~cond); 199#L2-3 havoc main_#t~mem2; 200#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-12-07 14:38:22,749 INFO L796 eck$LassoCheckResult]: Loop: 210#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 217#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 216#L2 assume !(0 == __VERIFIER_assert_~cond); 215#L2-3 havoc main_#t~mem2; 214#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-12-07 14:38:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2019-12-07 14:38:22,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042394926] [2019-12-07 14:38:22,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:38:22,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042394926] [2019-12-07 14:38:22,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612152046] [2019-12-07 14:38:22,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:38:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:22,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:38:22,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 14:38:22,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:38:22,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 14:38:22,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280318570] [2019-12-07 14:38:22,816 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:38:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2019-12-07 14:38:22,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405526556] [2019-12-07 14:38:22,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:22,826 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:22,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:38:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:22,924 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-12-07 14:38:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:22,959 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-12-07 14:38:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:38:22,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2019-12-07 14:38:22,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:22,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2019-12-07 14:38:22,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-12-07 14:38:22,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-12-07 14:38:22,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-12-07 14:38:22,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:38:22,962 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-12-07 14:38:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-12-07 14:38:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-12-07 14:38:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 14:38:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 14:38:22,964 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 14:38:22,964 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 14:38:22,964 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 14:38:22,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2019-12-07 14:38:22,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:22,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:22,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:22,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 14:38:22,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:38:22,966 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 309#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, 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; 310#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 323#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 324#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 313#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 314#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 326#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 325#L7-3 assume !(main_~i~0 < 100000); 318#L7-4 main_~i~0 := 0; 317#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 316#L2 assume !(0 == __VERIFIER_assert_~cond); 311#L2-3 havoc main_#t~mem2; 312#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 321#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 322#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 337#L2 assume !(0 == __VERIFIER_assert_~cond); 336#L2-3 havoc main_#t~mem2; 331#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 332#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 335#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 334#L2 assume !(0 == __VERIFIER_assert_~cond); 333#L2-3 havoc main_#t~mem2; 319#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 320#L11-2 [2019-12-07 14:38:22,966 INFO L796 eck$LassoCheckResult]: Loop: 320#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 330#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 329#L2 assume !(0 == __VERIFIER_assert_~cond); 328#L2-3 havoc main_#t~mem2; 327#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 320#L11-2 [2019-12-07 14:38:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2019-12-07 14:38:22,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:22,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926776536] [2019-12-07 14:38:22,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 14:38:23,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926776536] [2019-12-07 14:38:23,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970214646] [2019-12-07 14:38:23,012 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:38:23,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:38:23,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:38:23,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:38:23,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 14:38:23,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:38:23,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 14:38:23,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999775987] [2019-12-07 14:38:23,061 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:38:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2019-12-07 14:38:23,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:23,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019526602] [2019-12-07 14:38:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:23,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:23,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:38:23,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:38:23,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:38:23,170 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-12-07 14:38:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:23,204 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-12-07 14:38:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:23,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-12-07 14:38:23,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:23,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2019-12-07 14:38:23,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-12-07 14:38:23,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-12-07 14:38:23,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2019-12-07 14:38:23,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:38:23,207 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-12-07 14:38:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2019-12-07 14:38:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-12-07 14:38:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 14:38:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-12-07 14:38:23,210 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-12-07 14:38:23,210 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-12-07 14:38:23,210 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 14:38:23,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-12-07 14:38:23,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 14:38:23,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:38:23,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:38:23,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2019-12-07 14:38:23,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 14:38:23,213 INFO L794 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 457#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, 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; 458#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 468#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 469#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 459#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 460#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 473#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 472#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 471#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 470#L7-3 assume !(main_~i~0 < 100000); 464#L7-4 main_~i~0 := 0; 465#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 490#L2 assume !(0 == __VERIFIER_assert_~cond); 489#L2-3 havoc main_#t~mem2; 488#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 467#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 463#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 462#L2 assume !(0 == __VERIFIER_assert_~cond); 455#L2-3 havoc main_#t~mem2; 456#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 466#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 487#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 486#L2 assume !(0 == __VERIFIER_assert_~cond); 485#L2-3 havoc main_#t~mem2; 484#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 483#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 482#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 481#L2 assume !(0 == __VERIFIER_assert_~cond); 480#L2-3 havoc main_#t~mem2; 479#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 475#L11-2 [2019-12-07 14:38:23,213 INFO L796 eck$LassoCheckResult]: Loop: 475#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 478#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 477#L2 assume !(0 == __VERIFIER_assert_~cond); 476#L2-3 havoc main_#t~mem2; 474#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 475#L11-2 [2019-12-07 14:38:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2019-12-07 14:38:23,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:23,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329337629] [2019-12-07 14:38:23,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:38:23,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329337629] [2019-12-07 14:38:23,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396553206] [2019-12-07 14:38:23,261 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abaa4c62-7195-4bff-b73e-a561aa7d7c75/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:38:23,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 14:38:23,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:38:23,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:38:23,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:23,312 INFO L377 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 [2019-12-07 14:38:23,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:23,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:23,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:23,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 14:38:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:38:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 14:38:23,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:38:23,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-12-07 14:38:23,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528750738] [2019-12-07 14:38:23,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:38:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2019-12-07 14:38:23,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:38:23,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237468384] [2019-12-07 14:38:23,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:38:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:38:23,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:38:23,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:38:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:38:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:38:23,429 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-12-07 14:38:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:23,450 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-12-07 14:38:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:38:23,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2019-12-07 14:38:23,451 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:38:23,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-12-07 14:38:23,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 14:38:23,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 14:38:23,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 14:38:23,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:38:23,451 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:38:23,451 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:38:23,451 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:38:23,451 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 14:38:23,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:38:23,451 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:38:23,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 14:38:23,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 02:38:23 BoogieIcfgContainer [2019-12-07 14:38:23,455 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 14:38:23,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:38:23,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:38:23,456 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:38:23,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:38:21" (3/4) ... [2019-12-07 14:38:23,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:38:23,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:38:23,459 INFO L168 Benchmark]: Toolchain (without parser) took 2189.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.9 MB in the beginning and 1.0 GB in the end (delta: -68.1 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:38:23,460 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:38:23,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:38:23,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:38:23,461 INFO L168 Benchmark]: Boogie Preprocessor took 15.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:38:23,461 INFO L168 Benchmark]: RCFGBuilder took 160.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:38:23,461 INFO L168 Benchmark]: BuchiAutomizer took 1806.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:38:23,462 INFO L168 Benchmark]: Witness Printer took 2.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:38:23,464 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -162.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 160.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1806.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 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 1.7s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: 42 SDtfs, 62 SDslu, 48 SDs, 0 SdLazy, 127 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 1 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...