./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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 64bit --witnessprinter.graph.data.programhash ace4aef293e19a259ba259e8c5434d0ef43394b5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:47:09,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:09,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:09,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:09,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:09,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:09,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:09,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:09,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:09,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:09,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:09,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:09,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:09,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:09,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:09,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:09,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:09,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:09,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:09,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:09,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:09,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:09,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:09,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:09,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:09,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:09,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:09,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:09,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:09,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:09,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:09,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:09,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:09,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:09,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:09,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:09,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:09,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:09,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:09,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:09,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:09,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:47:09,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:09,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:09,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:09,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:09,617 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:09,617 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:47:09,617 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:47:09,617 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:47:09,618 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:47:09,618 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:47:09,619 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:47:09,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:09,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:47:09,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:09,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:09,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:47:09,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:47:09,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:47:09,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:09,621 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:47:09,621 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:09,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:47:09,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:09,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:09,622 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:47:09,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:09,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:09,623 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:47:09,624 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:47:09,625 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_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2019-11-25 08:47:09,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:09,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:09,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:09,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:09,773 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:09,774 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2019-11-25 08:47:09,828 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/data/fded90209/cb566589b3e7481d87b768ba95d7fc58/FLAG9bd3bb888 [2019-11-25 08:47:10,312 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:10,312 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2019-11-25 08:47:10,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/data/fded90209/cb566589b3e7481d87b768ba95d7fc58/FLAG9bd3bb888 [2019-11-25 08:47:10,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/data/fded90209/cb566589b3e7481d87b768ba95d7fc58 [2019-11-25 08:47:10,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:10,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:10,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:10,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:10,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:10,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d40d508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10, skipping insertion in model container [2019-11-25 08:47:10,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:10,393 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:10,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:10,717 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:10,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:10,795 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:10,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10 WrapperNode [2019-11-25 08:47:10,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:10,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:10,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:10,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:10,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:10,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:10,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:10,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:10,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... [2019-11-25 08:47:10,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:10,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:10,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:10,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:10,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:47:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:47:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:47:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:47:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:11,235 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:11,235 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 08:47:11,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:11 BoogieIcfgContainer [2019-11-25 08:47:11,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:11,237 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:47:11,237 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:47:11,240 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:47:11,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:11,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:47:10" (1/3) ... [2019-11-25 08:47:11,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11c6d294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:47:11, skipping insertion in model container [2019-11-25 08:47:11,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:11,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:10" (2/3) ... [2019-11-25 08:47:11,242 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11c6d294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:47:11, skipping insertion in model container [2019-11-25 08:47:11,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:47:11,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:11" (3/3) ... [2019-11-25 08:47:11,243 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2019-11-25 08:47:11,279 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:47:11,279 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:47:11,279 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:47:11,279 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:11,280 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:11,280 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:47:11,280 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:11,280 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:47:11,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-25 08:47:11,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:11,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:11,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:11,317 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:47:11,317 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:11,318 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:47:11,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-25 08:47:11,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:11,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:11,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:11,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:47:11,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:11,326 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 11#L552-3true [2019-11-25 08:47:11,326 INFO L796 eck$LassoCheckResult]: Loop: 11#L552-3true goto; 5#L554-1true call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 8#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 12#L554true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 11#L552-3true [2019-11-25 08:47:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,330 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-25 08:47:11,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846250567] [2019-11-25 08:47:11,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2019-11-25 08:47:11,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312748879] [2019-11-25 08:47:11,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2019-11-25 08:47:11,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816239903] [2019-11-25 08:47:11,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:11,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816239903] [2019-11-25 08:47:11,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:11,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:47:11,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024249140] [2019-11-25 08:47:11,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:11,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:11,763 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2019-11-25 08:47:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:11,812 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-25 08:47:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:47:11,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-11-25 08:47:11,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:11,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2019-11-25 08:47:11,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:47:11,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:47:11,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-25 08:47:11,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:47:11,822 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-25 08:47:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-25 08:47:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-25 08:47:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-25 08:47:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-25 08:47:11,848 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-25 08:47:11,848 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-25 08:47:11,849 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:47:11,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-25 08:47:11,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:11,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:11,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:11,852 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:47:11,852 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:47:11,852 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 37#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 38#L552-3 goto; 39#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 40#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 42#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2019-11-25 08:47:11,853 INFO L796 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 46#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 44#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2019-11-25 08:47:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2019-11-25 08:47:11,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757859730] [2019-11-25 08:47:11,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-25 08:47:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306549055] [2019-11-25 08:47:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,951 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2019-11-25 08:47:11,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643462050] [2019-11-25 08:47:11,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:12,166 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-25 08:47:12,461 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-11-25 08:47:12,570 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:12,572 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:12,572 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:12,573 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:12,573 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:12,573 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:12,573 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:12,573 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:12,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2019-11-25 08:47:12,581 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:12,582 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:12,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,812 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-11-25 08:47:12,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:12,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:13,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:13,278 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:13,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:13,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:13,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:13,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:13,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:13,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:13,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:13,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:13,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:13,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:13,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:13,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:13,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:13,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:13,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:13,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:13,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:13,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:13,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:13,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:13,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:13,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:13,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:13,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:13,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:13,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:13,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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) [2019-11-25 08:47:13,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:13,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:13,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:13,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:13,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:13,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:13,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:13,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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) [2019-11-25 08:47:13,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:13,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:13,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:13,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:13,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:13,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:13,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:13,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:13,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:13,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:13,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:13,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:13,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:13,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:13,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:13,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:13,426 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-25 08:47:13,426 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:13,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:13,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:47:13,498 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:13,498 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2019-11-25 08:47:13,563 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-25 08:47:13,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-11-25 08:47:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:13,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:47:13,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:13,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:47:13,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:13,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-11-25 08:47:13,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:13,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:13,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:13,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:13,716 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:47:13,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-25 08:47:13,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 6 states. [2019-11-25 08:47:13,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:47:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:47:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-25 08:47:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-25 08:47:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-25 08:47:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:13,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-25 08:47:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:13,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-11-25 08:47:13,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:13,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2019-11-25 08:47:13,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:13,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:47:13,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-25 08:47:13,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:13,781 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-25 08:47:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-25 08:47:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-25 08:47:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:47:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-25 08:47:13,783 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-25 08:47:13,783 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-25 08:47:13,783 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:47:13,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-25 08:47:13,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:13,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:13,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:13,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-25 08:47:13,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:13,785 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 154#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 155#L552-3 goto; 169#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 168#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 167#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 166#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 157#L552-1 [2019-11-25 08:47:13,785 INFO L796 eck$LassoCheckResult]: Loop: 157#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 161#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 163#L552-3 goto; 156#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 157#L552-1 [2019-11-25 08:47:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2019-11-25 08:47:13,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:13,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797059256] [2019-11-25 08:47:13,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:13,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2019-11-25 08:47:13,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:13,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903062786] [2019-11-25 08:47:13,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:13,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2019-11-25 08:47:13,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:13,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647033171] [2019-11-25 08:47:13,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:13,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647033171] [2019-11-25 08:47:13,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038796376] [2019-11-25 08:47:13,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 08:47:14,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:14,078 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-25 08:47:14,079 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:14,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:14,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-25 08:47:14,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:14,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:14,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-25 08:47:14,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-25 08:47:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:14,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:14,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-25 08:47:14,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013099041] [2019-11-25 08:47:14,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:14,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:47:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:47:14,244 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-25 08:47:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:14,388 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-25 08:47:14,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:47:14,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-25 08:47:14,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:14,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2019-11-25 08:47:14,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:14,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:14,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-11-25 08:47:14,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:14,391 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-25 08:47:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-11-25 08:47:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-25 08:47:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-25 08:47:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-25 08:47:14,393 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-25 08:47:14,393 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-25 08:47:14,393 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:47:14,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-25 08:47:14,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:14,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:14,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:14,395 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2019-11-25 08:47:14,395 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:14,395 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 243#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 244#L552-3 goto; 260#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 250#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 251#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 259#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 258#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 256#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 257#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 246#L552-1 [2019-11-25 08:47:14,395 INFO L796 eck$LassoCheckResult]: Loop: 246#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 255#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 253#L552-3 goto; 245#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 246#L552-1 [2019-11-25 08:47:14,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:14,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2019-11-25 08:47:14,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:14,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739432750] [2019-11-25 08:47:14,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:14,446 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2019-11-25 08:47:14,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:14,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821703069] [2019-11-25 08:47:14,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:14,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2019-11-25 08:47:14,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:14,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562916886] [2019-11-25 08:47:14,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:14,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562916886] [2019-11-25 08:47:14,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360227363] [2019-11-25 08:47:14,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:14,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:14,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:14,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:47:14,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:14,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:14,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:14,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:14,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:14,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:14,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:14,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:14,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:14,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:14,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:14,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:14,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:14,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:14,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-25 08:47:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:14,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:14,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-25 08:47:14,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994242424] [2019-11-25 08:47:14,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:47:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:47:14,959 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-25 08:47:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:15,189 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-25 08:47:15,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:47:15,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-25 08:47:15,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:15,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2019-11-25 08:47:15,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:15,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:15,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-25 08:47:15,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:15,192 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-25 08:47:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-25 08:47:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-25 08:47:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-25 08:47:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-25 08:47:15,195 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-25 08:47:15,195 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-25 08:47:15,195 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:47:15,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-11-25 08:47:15,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:15,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:15,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:15,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2019-11-25 08:47:15,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:15,196 INFO L794 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 353#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 354#L552-3 goto; 373#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 372#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 371#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 355#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 356#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 362#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 357#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 358#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 370#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 368#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#L552-1 [2019-11-25 08:47:15,197 INFO L796 eck$LassoCheckResult]: Loop: 360#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 361#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 363#L552-3 goto; 364#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#L552-1 [2019-11-25 08:47:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2019-11-25 08:47:15,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:15,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268527521] [2019-11-25 08:47:15,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:15,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2019-11-25 08:47:15,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:15,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051040322] [2019-11-25 08:47:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:15,266 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2019-11-25 08:47:15,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:15,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846422378] [2019-11-25 08:47:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:15,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846422378] [2019-11-25 08:47:15,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319191771] [2019-11-25 08:47:15,429 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/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-11-25 08:47:15,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-25 08:47:15,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:15,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 08:47:15,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:15,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:15,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:15,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:15,531 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:15,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:15,539 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:15,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:15,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:15,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:15,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:15,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:15,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:15,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:15,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:15,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:15,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:15,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:15,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:15,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:15,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:15,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:15,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-25 08:47:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:15,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:15,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-25 08:47:15,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004882660] [2019-11-25 08:47:15,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:47:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:47:15,810 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-11-25 08:47:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:16,154 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-25 08:47:16,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:47:16,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-25 08:47:16,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:16,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2019-11-25 08:47:16,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:16,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:16,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-11-25 08:47:16,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:16,157 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-25 08:47:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-11-25 08:47:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-25 08:47:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-25 08:47:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-25 08:47:16,160 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-25 08:47:16,160 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-25 08:47:16,160 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:47:16,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-25 08:47:16,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:16,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:16,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:16,161 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2019-11-25 08:47:16,162 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:16,162 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 485#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 486#L552-3 goto; 507#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 506#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 504#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 487#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 488#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 508#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 489#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 490#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 494#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 503#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 505#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 499#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 500#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 492#L552-1 [2019-11-25 08:47:16,162 INFO L796 eck$LassoCheckResult]: Loop: 492#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 493#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 495#L552-3 goto; 496#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 492#L552-1 [2019-11-25 08:47:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2019-11-25 08:47:16,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:16,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346677181] [2019-11-25 08:47:16,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:16,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2019-11-25 08:47:16,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:16,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875528673] [2019-11-25 08:47:16,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:16,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2019-11-25 08:47:16,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:16,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829175950] [2019-11-25 08:47:16,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:16,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829175950] [2019-11-25 08:47:16,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110360948] [2019-11-25 08:47:16,355 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:16,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:47:16,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:16,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 08:47:16,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:16,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:16,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:16,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:16,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:16,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:16,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:16,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:16,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:16,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:16,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:16,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:16,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:16,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:16,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:16,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:16,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:16,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:16,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:16,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:16,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-25 08:47:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:16,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:16,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-25 08:47:16,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000780412] [2019-11-25 08:47:16,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 08:47:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:47:16,765 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-11-25 08:47:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:17,150 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-25 08:47:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:47:17,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2019-11-25 08:47:17,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:17,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2019-11-25 08:47:17,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:17,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:17,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2019-11-25 08:47:17,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:17,153 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-25 08:47:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2019-11-25 08:47:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-25 08:47:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:47:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-25 08:47:17,155 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-25 08:47:17,155 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-25 08:47:17,156 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:47:17,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2019-11-25 08:47:17,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:17,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:17,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:17,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2019-11-25 08:47:17,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:17,158 INFO L794 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 639#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 640#L552-3 goto; 649#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 657#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 664#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 641#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 642#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 653#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 643#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 644#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 648#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 663#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 662#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 661#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 660#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 659#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 658#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 655#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 646#L552-1 [2019-11-25 08:47:17,158 INFO L796 eck$LassoCheckResult]: Loop: 646#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 647#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 652#L552-3 goto; 665#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 646#L552-1 [2019-11-25 08:47:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2019-11-25 08:47:17,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:17,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909790082] [2019-11-25 08:47:17,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:17,184 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2019-11-25 08:47:17,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:17,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211636125] [2019-11-25 08:47:17,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:17,193 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2019-11-25 08:47:17,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:17,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108168460] [2019-11-25 08:47:17,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:17,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108168460] [2019-11-25 08:47:17,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573557647] [2019-11-25 08:47:17,388 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:17,458 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-25 08:47:17,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:17,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:47:17,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:17,478 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-25 08:47:17,478 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:17,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:17,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-25 08:47:17,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:17,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:17,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:17,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:17,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:17,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:17,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:17,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:17,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:17,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:17,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-25 08:47:17,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:17,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:17,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-25 08:47:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:17,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:17,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-11-25 08:47:17,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463944339] [2019-11-25 08:47:17,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:17,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 08:47:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:47:17,788 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand 22 states. [2019-11-25 08:47:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:18,271 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-25 08:47:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:47:18,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2019-11-25 08:47:18,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:18,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2019-11-25 08:47:18,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:18,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:18,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2019-11-25 08:47:18,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:18,275 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-25 08:47:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2019-11-25 08:47:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-25 08:47:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:47:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-25 08:47:18,277 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-25 08:47:18,278 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-25 08:47:18,278 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:47:18,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-11-25 08:47:18,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:18,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:18,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:18,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2019-11-25 08:47:18,279 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:18,279 INFO L794 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 815#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 816#L552-3 goto; 825#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 832#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 833#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 817#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 818#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 824#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 819#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 820#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 844#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 843#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 842#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 841#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 840#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 839#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 838#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 837#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 835#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 834#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 830#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 822#L552-1 [2019-11-25 08:47:18,279 INFO L796 eck$LassoCheckResult]: Loop: 822#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 823#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 828#L552-3 goto; 836#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 822#L552-1 [2019-11-25 08:47:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2019-11-25 08:47:18,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520572146] [2019-11-25 08:47:18,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,325 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2019-11-25 08:47:18,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182672510] [2019-11-25 08:47:18,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:18,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2019-11-25 08:47:18,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:18,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59330798] [2019-11-25 08:47:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:18,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59330798] [2019-11-25 08:47:18,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532462652] [2019-11-25 08:47:18,577 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:18,640 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-25 08:47:18,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:18,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:47:18,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:18,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:18,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:18,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:18,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:18,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:18,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:18,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:18,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:18,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:18,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:18,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:18,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:18,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:18,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-25 08:47:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:18,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:18,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2019-11-25 08:47:18,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343426008] [2019-11-25 08:47:19,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-25 08:47:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:47:19,026 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 25 states. [2019-11-25 08:47:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:19,611 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-25 08:47:19,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 08:47:19,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2019-11-25 08:47:19,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:19,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2019-11-25 08:47:19,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:19,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:19,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2019-11-25 08:47:19,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:19,616 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-25 08:47:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2019-11-25 08:47:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-25 08:47:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-25 08:47:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-25 08:47:19,619 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-25 08:47:19,619 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-25 08:47:19,619 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:47:19,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2019-11-25 08:47:19,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:19,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:19,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:19,621 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2019-11-25 08:47:19,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:19,622 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1013#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1014#L552-3 goto; 1023#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1030#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1031#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1015#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1016#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1022#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1017#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1018#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1045#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1044#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1043#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1042#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1041#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1040#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1039#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1038#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1037#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1036#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1035#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1033#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1032#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1028#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1020#L552-1 [2019-11-25 08:47:19,622 INFO L796 eck$LassoCheckResult]: Loop: 1020#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1021#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1026#L552-3 goto; 1034#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1020#L552-1 [2019-11-25 08:47:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2019-11-25 08:47:19,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:19,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627688835] [2019-11-25 08:47:19,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,648 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:19,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2019-11-25 08:47:19,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:19,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785977990] [2019-11-25 08:47:19,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:19,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2019-11-25 08:47:19,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:19,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403435747] [2019-11-25 08:47:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:19,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403435747] [2019-11-25 08:47:19,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163814349] [2019-11-25 08:47:19,945 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:20,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:47:20,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:20,035 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-25 08:47:20,035 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:20,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:20,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-25 08:47:20,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:20,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:20,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-25 08:47:20,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:20,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:20,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-25 08:47:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:20,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:20,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-11-25 08:47:20,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057066386] [2019-11-25 08:47:20,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:20,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-25 08:47:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-11-25 08:47:20,390 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand 28 states. [2019-11-25 08:47:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:20,974 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-25 08:47:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-25 08:47:20,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-11-25 08:47:20,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:20,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2019-11-25 08:47:20,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:20,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:20,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2019-11-25 08:47:20,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:20,977 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-25 08:47:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2019-11-25 08:47:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-25 08:47:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:47:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-25 08:47:20,979 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-25 08:47:20,980 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-25 08:47:20,980 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:47:20,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-11-25 08:47:20,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:20,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:20,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:20,981 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2019-11-25 08:47:20,981 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:20,981 INFO L794 eck$LassoCheckResult]: Stem: 1239#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1233#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1234#L552-3 goto; 1243#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1250#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1251#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1235#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1236#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1242#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1237#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1238#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1268#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1267#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1266#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1265#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1264#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1263#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1262#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1261#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1260#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1259#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1258#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1257#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1256#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1255#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1253#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1252#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1248#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1240#L552-1 [2019-11-25 08:47:20,981 INFO L796 eck$LassoCheckResult]: Loop: 1240#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1241#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1246#L552-3 goto; 1254#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1240#L552-1 [2019-11-25 08:47:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2019-11-25 08:47:20,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:20,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039851932] [2019-11-25 08:47:20,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:21,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2019-11-25 08:47:21,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:21,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104642486] [2019-11-25 08:47:21,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:21,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2019-11-25 08:47:21,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:21,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169129483] [2019-11-25 08:47:21,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:21,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169129483] [2019-11-25 08:47:21,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067050957] [2019-11-25 08:47:21,314 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:21,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:47:21,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:21,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:47:21,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:21,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:21,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:21,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:21,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:21,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:21,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:21,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:21,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:21,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-25 08:47:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:21,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:21,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2019-11-25 08:47:21,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606248198] [2019-11-25 08:47:21,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:21,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-25 08:47:21,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-11-25 08:47:21,863 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 31 states. [2019-11-25 08:47:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:22,699 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-25 08:47:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:47:22,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-11-25 08:47:22,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:22,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2019-11-25 08:47:22,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:22,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:22,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2019-11-25 08:47:22,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:22,702 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-25 08:47:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2019-11-25 08:47:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-25 08:47:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:47:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-25 08:47:22,705 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-25 08:47:22,705 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-25 08:47:22,705 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:47:22,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2019-11-25 08:47:22,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:22,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:22,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:22,707 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2019-11-25 08:47:22,707 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:22,707 INFO L794 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1475#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1476#L552-3 goto; 1485#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1492#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1493#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1477#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1478#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1484#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1479#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1480#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1513#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1512#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1511#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1510#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1509#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1508#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1507#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1506#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1505#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1504#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1503#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1502#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1501#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1500#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1499#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1498#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1497#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1495#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1494#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1490#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1482#L552-1 [2019-11-25 08:47:22,707 INFO L796 eck$LassoCheckResult]: Loop: 1482#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1483#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1488#L552-3 goto; 1496#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1482#L552-1 [2019-11-25 08:47:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2019-11-25 08:47:22,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983729925] [2019-11-25 08:47:22,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2019-11-25 08:47:22,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098027672] [2019-11-25 08:47:22,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:22,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2019-11-25 08:47:22,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:22,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404866467] [2019-11-25 08:47:22,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:23,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404866467] [2019-11-25 08:47:23,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946766372] [2019-11-25 08:47:23,150 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:23,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-25 08:47:23,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:47:23,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:47:23,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:23,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:23,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:23,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:23,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:23,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-25 08:47:23,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-25 08:47:23,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:23,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:23,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-25 08:47:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:23,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:23,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2019-11-25 08:47:23,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544589869] [2019-11-25 08:47:23,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 08:47:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 08:47:23,999 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 34 states. [2019-11-25 08:47:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:24,928 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-25 08:47:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-25 08:47:24,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2019-11-25 08:47:24,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:24,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2019-11-25 08:47:24,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:47:24,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:24,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2019-11-25 08:47:24,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:24,931 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-25 08:47:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2019-11-25 08:47:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-25 08:47:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:47:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-25 08:47:24,934 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-25 08:47:24,934 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-25 08:47:24,934 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:47:24,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2019-11-25 08:47:24,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:24,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:24,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:24,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2019-11-25 08:47:24,936 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:24,936 INFO L794 eck$LassoCheckResult]: Stem: 1745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1739#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1740#L552-3 goto; 1749#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1756#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1757#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1741#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1742#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1748#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1743#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1744#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1780#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1779#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1778#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1777#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1776#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1775#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1774#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1773#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1772#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1771#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1770#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1769#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1768#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1767#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1766#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1765#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1764#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1763#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1762#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1761#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1759#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1758#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1754#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1746#L552-1 [2019-11-25 08:47:24,936 INFO L796 eck$LassoCheckResult]: Loop: 1746#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1747#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 1752#L552-3 goto; 1760#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1746#L552-1 [2019-11-25 08:47:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2019-11-25 08:47:24,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:24,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964231251] [2019-11-25 08:47:24,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:24,966 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:24,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:24,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2019-11-25 08:47:24,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:24,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164308219] [2019-11-25 08:47:24,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:24,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2019-11-25 08:47:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40600917] [2019-11-25 08:47:24,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:25,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:34,578 WARN L192 SmtUtils]: Spent 9.50 s on a formula simplification. DAG size of input: 204 DAG size of output: 172 [2019-11-25 08:47:34,682 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:47:34,683 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:47:34,683 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:47:34,683 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:47:34,683 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:47:34,683 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:34,683 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:47:34,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:47:34,683 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2019-11-25 08:47:34,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:47:34,684 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:47:34,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:34,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:47:35,250 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:47:35,250 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:47:35,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:35,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:35,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:35,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:35,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:35,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:35,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:47:35,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:47:35,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:47:35,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:47:35,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:47:35,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:47:35,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:47:35,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:47:35,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:47:35,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:47:35,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:47:35,449 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-25 08:47:35,450 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:47:35,453 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:47:35,455 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:47:35,455 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:47:35,455 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2) = -11*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 + 224 Supporting invariants [23*ULTIMATE.start_main_#t~mem4 - 22*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2019-11-25 08:47:35,488 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-11-25 08:47:35,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-25 08:47:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:35,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 08:47:35,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:35,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:35,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:35,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:35,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:35,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:35,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:35,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:35,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:36,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:36,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:36,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-25 08:47:36,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-25 08:47:36,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2019-11-25 08:47:36,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:36,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:36,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:36,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:36,215 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,268 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-25 08:47:36,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:36,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:47:36,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:65 [2019-11-25 08:47:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:36,319 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2019-11-25 08:47:36,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-25 08:47:36,405 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 42 states and 44 transitions. Complement of second has 5 states. [2019-11-25 08:47:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2019-11-25 08:47:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:47:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-25 08:47:36,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-25 08:47:36,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:36,406 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:36,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:36,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 08:47:36,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:36,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:36,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:36,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:36,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:36,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:36,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:36,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:36,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:36,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:36,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-25 08:47:36,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-25 08:47:37,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2019-11-25 08:47:37,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:37,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:37,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:37,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:37,063 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,120 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-25 08:47:37,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:37,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:47:37,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:65 [2019-11-25 08:47:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:37,170 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2019-11-25 08:47:37,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-25 08:47:37,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 43 states and 45 transitions. Complement of second has 6 states. [2019-11-25 08:47:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:47:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:47:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-25 08:47:37,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-25 08:47:37,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:37,235 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:37,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 08:47:37,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:37,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:37,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:37,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:37,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:37,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:37,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:37,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:37,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-25 08:47:37,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:37,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-25 08:47:37,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:37,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2019-11-25 08:47:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:37,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:37,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:37,975 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,028 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-25 08:47:38,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:38,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:38,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:38,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:38,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:38,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-25 08:47:38,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:86 [2019-11-25 08:47:38,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:38,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:38,165 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2019-11-25 08:47:38,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-25 08:47:38,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 48 states and 52 transitions. Complement of second has 34 states. [2019-11-25 08:47:38,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 12 stem states 0 non-accepting loop states 2 accepting loop states [2019-11-25 08:47:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:47:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2019-11-25 08:47:38,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 53 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-25 08:47:38,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:38,647 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:47:38,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:38,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 08:47:38,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:38,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 08:47:38,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:38,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:38,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:38,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:38,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:38,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:38,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:38,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:38,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:38,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:38,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:38,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:38,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:38,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:38,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:38,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:38,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:39,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:39,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:39,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:39,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:39,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:39,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:39,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:39,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:39,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:39,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:39,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:39,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:39,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:39,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:39,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:39,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-25 08:47:39,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:39,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:39,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:39,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-25 08:47:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:39,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:47:39,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:39,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-25 08:47:39,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:39,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:39,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:39,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-25 08:47:39,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:39,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2019-11-25 08:47:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:39,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:47:39,274 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:39,328 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-25 08:47:39,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:47:39,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:47:39,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:65 [2019-11-25 08:47:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:39,383 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2019-11-25 08:47:39,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-25 08:47:39,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 69 states and 75 transitions. Complement of second has 49 states. [2019-11-25 08:47:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-25 08:47:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:47:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2019-11-25 08:47:39,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-25 08:47:39,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:39,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2019-11-25 08:47:39,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:39,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2019-11-25 08:47:39,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:47:39,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2019-11-25 08:47:39,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:39,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2019-11-25 08:47:39,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-25 08:47:39,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:47:39,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2019-11-25 08:47:39,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:47:39,782 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-25 08:47:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2019-11-25 08:47:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-11-25 08:47:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-25 08:47:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-25 08:47:39,786 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-25 08:47:39,786 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-25 08:47:39,786 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-25 08:47:39,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2019-11-25 08:47:39,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-25 08:47:39,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:47:39,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:47:39,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2019-11-25 08:47:39,788 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:47:39,789 INFO L794 eck$LassoCheckResult]: Stem: 2700#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2694#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2695#L552-3 goto; 2717#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2701#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2702#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2696#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2697#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2703#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2698#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2699#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2740#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2739#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2738#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2737#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2736#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2735#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2734#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2733#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2732#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2731#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2730#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2729#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2728#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2727#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2726#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2725#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2724#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2723#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2722#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2721#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2720#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2719#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2707#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2716#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2715#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2711#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2710#L552-1 [2019-11-25 08:47:39,789 INFO L796 eck$LassoCheckResult]: Loop: 2710#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2708#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post9;havoc main_#t~mem8; 2704#L552-3 goto; 2705#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2710#L552-1 [2019-11-25 08:47:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2019-11-25 08:47:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:39,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389382320] [2019-11-25 08:47:39,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:40,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389382320] [2019-11-25 08:47:40,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068647138] [2019-11-25 08:47:40,075 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c53b6f1-c5ab-43b4-9b8b-6c4ae8f3e9a0/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:47:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:40,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:47:40,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:47:40,147 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-25 08:47:40,148 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-25 08:47:40,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:47:40,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-25 08:47:40,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-25 08:47:40,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-25 08:47:40,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-25 08:47:40,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:47:40,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:47:40,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-25 08:47:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:40,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:47:40,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 36 [2019-11-25 08:47:40,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457184566] [2019-11-25 08:47:40,573 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:47:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2019-11-25 08:47:40,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:40,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206542200] [2019-11-25 08:47:40,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:40,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:40,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:40,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-25 08:47:40,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2019-11-25 08:47:40,654 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand 36 states. [2019-11-25 08:47:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:41,204 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-11-25 08:47:41,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-25 08:47:41,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2019-11-25 08:47:41,205 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:47:41,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-25 08:47:41,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-25 08:47:41,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-25 08:47:41,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-25 08:47:41,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:47:41,206 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:41,206 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:41,206 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:47:41,206 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-25 08:47:41,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:47:41,206 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-25 08:47:41,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-25 08:47:41,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:47:41 BoogieIcfgContainer [2019-11-25 08:47:41,212 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:47:41,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:41,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:41,213 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:41,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:11" (3/4) ... [2019-11-25 08:47:41,216 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:47:41,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:41,218 INFO L168 Benchmark]: Toolchain (without parser) took 30875.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -281.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:41,218 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:41,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:41,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:41,219 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:41,219 INFO L168 Benchmark]: RCFGBuilder took 376.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:41,220 INFO L168 Benchmark]: BuchiAutomizer took 29975.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:41,220 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:41,221 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 453.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29975.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 19 and consists of 4 locations. One nondeterministic module has affine ranking function -11 * unknown-#memory_int-unknown[i][i] + 224 and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.9s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 20.1s. Construction of modules took 2.5s. Büchi inclusion checks took 7.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 0, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 92 SDtfs, 110 SDslu, 597 SDs, 0 SdLazy, 3350 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax107 hnf100 lsp89 ukn46 mio100 lsp42 div100 bol100 ite100 ukn100 eq175 hnf89 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...