./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-678e011 [2019-11-20 11:20:25,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:20:25,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:20:25,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:20:25,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:20:25,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:20:25,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:20:25,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:20:25,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:20:25,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:20:25,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:20:25,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:20:25,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:20:25,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:20:25,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:20:25,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:20:25,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:20:25,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:20:25,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:20:25,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:20:25,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:20:25,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:20:25,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:20:25,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:20:25,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:20:25,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:20:25,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:20:25,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:20:25,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:20:25,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:20:25,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:20:25,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:20:25,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:20:25,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:20:25,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:20:25,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:20:25,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:20:25,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:20:25,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:20:25,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:20:25,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:20:25,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 11:20:25,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:20:25,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:20:25,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:20:25,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:20:25,298 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:20:25,298 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 11:20:25,298 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 11:20:25,298 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 11:20:25,299 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 11:20:25,299 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 11:20:25,299 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 11:20:25,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:20:25,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:20:25,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:20:25,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:20:25,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 11:20:25,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 11:20:25,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 11:20:25,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:20:25,301 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 11:20:25,301 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:20:25,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 11:20:25,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:20:25,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:20:25,301 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 11:20:25,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:20:25,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:20:25,302 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 11:20:25,303 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 11:20:25,303 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_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:25,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:20:25,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:20:25,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:20:25,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:20:25,460 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:20:25,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2019-11-20 11:20:25,518 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/data/4ba5f977b/ec540e25429d45c8b5b843815fe9ba90/FLAGb56f24ca8 [2019-11-20 11:20:25,976 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:20:25,976 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2019-11-20 11:20:25,998 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/data/4ba5f977b/ec540e25429d45c8b5b843815fe9ba90/FLAGb56f24ca8 [2019-11-20 11:20:26,012 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/data/4ba5f977b/ec540e25429d45c8b5b843815fe9ba90 [2019-11-20 11:20:26,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:20:26,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:20:26,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:20:26,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:20:26,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:20:26,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55275a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26, skipping insertion in model container [2019-11-20 11:20:26,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,040 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:20:26,090 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:20:26,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:20:26,483 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:20:26,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:20:26,566 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:20:26,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26 WrapperNode [2019-11-20 11:20:26,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:20:26,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:20:26,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:20:26,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:20:26,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:20:26,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:20:26,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:20:26,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:20:26,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... [2019-11-20 11:20:26,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:20:26,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:20:26,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:20:26,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:20:26,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:20:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:20:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:20:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:20:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:20:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:20:26,895 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:20:26,895 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 11:20:26,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:20:26 BoogieIcfgContainer [2019-11-20 11:20:26,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:20:26,897 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 11:20:26,897 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 11:20:26,900 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 11:20:26,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:20:26,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:20:26" (1/3) ... [2019-11-20 11:20:26,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a5d965d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:20:26, skipping insertion in model container [2019-11-20 11:20:26,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:20:26,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:20:26" (2/3) ... [2019-11-20 11:20:26,909 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a5d965d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:20:26, skipping insertion in model container [2019-11-20 11:20:26,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:20:26,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:20:26" (3/3) ... [2019-11-20 11:20:26,911 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2019-11-20 11:20:26,968 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 11:20:26,968 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 11:20:26,968 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 11:20:26,969 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:20:26,969 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:20:26,969 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 11:20:26,969 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:20:26,969 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 11:20:26,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-20 11:20:26,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:26,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:26,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:27,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 11:20:27,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:27,001 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 11:20:27,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-20 11:20:27,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:27,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:27,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:27,003 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 11:20:27,003 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:27,008 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-20 11:20:27,009 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-20 11:20:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 11:20:27,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:27,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665885438] [2019-11-20 11:20:27,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2019-11-20 11:20:27,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:27,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364956344] [2019-11-20 11:20:27,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2019-11-20 11:20:27,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:27,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931971086] [2019-11-20 11:20:27,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:27,304 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-20 11:20:27,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931971086] [2019-11-20 11:20:27,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:20:27,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:20:27,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212541708] [2019-11-20 11:20:27,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:20:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:20:27,444 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2019-11-20 11:20:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:27,486 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-20 11:20:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:20:27,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-11-20 11:20:27,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:27,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2019-11-20 11:20:27,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 11:20:27,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-20 11:20:27,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-20 11:20:27,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:20:27,497 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-20 11:20:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-20 11:20:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 11:20:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 11:20:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-20 11:20:27,525 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-20 11:20:27,525 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-20 11:20:27,526 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 11:20:27,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-20 11:20:27,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:27,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:27,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:27,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 11:20:27,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:20:27,529 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-20 11:20:27,530 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-20 11:20:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:27,531 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2019-11-20 11:20:27,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:27,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12378688] [2019-11-20 11:20:27,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-20 11:20:27,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:27,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223369153] [2019-11-20 11:20:27,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,611 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2019-11-20 11:20:27,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:27,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396757638] [2019-11-20 11:20:27,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:27,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:28,019 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-11-20 11:20:28,153 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 11:20:28,165 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:20:28,165 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:20:28,166 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:20:28,166 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:20:28,166 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:20:28,166 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:28,166 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:20:28,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:20:28,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2019-11-20 11:20:28,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:20:28,167 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:20:28,189 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-20 11:20:28,194 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-20 11:20:28,198 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-20 11:20:28,201 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-20 11:20:28,210 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-20 11:20:28,410 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-20 11:20:28,413 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-20 11:20:28,416 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-20 11:20:28,419 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-20 11:20:28,422 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-20 11:20:28,430 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-20 11:20:28,435 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-20 11:20:28,440 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-20 11:20:28,443 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-20 11:20:28,447 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-20 11:20:28,863 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:20:28,868 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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) [2019-11-20 11:20:28,882 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-20 11:20:28,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:28,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:20:28,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:28,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:28,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:28,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:20:28,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:28,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:28,908 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-20 11:20:28,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:28,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:20:28,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:28,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:28,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:28,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:20:28,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:20:28,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:28,926 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-20 11:20:28,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:28,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:20:28,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:28,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:28,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:28,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:20:28,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:20:28,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:28,947 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-20 11:20:28,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:28,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:28,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:28,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:28,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:28,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:28,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:28,971 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-20 11:20:28,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:28,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:28,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:28,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:28,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:28,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:28,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:28,998 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-20 11:20:29,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:29,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:29,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:29,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:29,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:29,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:29,014 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:20:29,059 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 11:20:29,060 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_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:29,065 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-20 11:20:29,069 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 11:20:29,069 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:20:29,070 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-20 11:20:29,104 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-20 11:20:29,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 11:20:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:29,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:20:29,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:29,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:20:29,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:29,285 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-20 11:20:29,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:29,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:29,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:29,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:29,317 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-20 11:20:29,321 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-20 11:20:29,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-20 11:20:29,381 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-20 11:20:29,382 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-20 11:20:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 11:20:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-20 11:20:29,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-20 11:20:29,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:29,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-20 11:20:29,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:29,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-20 11:20:29,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:29,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-11-20 11:20:29,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:29,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2019-11-20 11:20:29,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:29,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 11:20:29,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-20 11:20:29,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:29,390 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-20 11:20:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-20 11:20:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-20 11:20:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 11:20:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-20 11:20:29,392 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 11:20:29,392 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-20 11:20:29,392 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 11:20:29,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-20 11:20:29,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:29,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:29,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:29,393 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-20 11:20:29,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:29,394 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-20 11:20:29,394 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-20 11:20:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2019-11-20 11:20:29,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:29,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469084865] [2019-11-20 11:20:29,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:29,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2019-11-20 11:20:29,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:29,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880903187] [2019-11-20 11:20:29,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:29,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2019-11-20 11:20:29,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:29,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262688794] [2019-11-20 11:20:29,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:29,556 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-20 11:20:29,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262688794] [2019-11-20 11:20:29,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155544677] [2019-11-20 11:20:29,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:29,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 11:20:29,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:29,636 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-20 11:20:29,637 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-20 11:20:29,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:29,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:29,645 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-20 11:20:29,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-20 11:20:29,678 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-20 11:20:29,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:29,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:29,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:29,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:29,723 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-20 11:20:29,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:29,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:29,726 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-20 11:20:29,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 11:20:29,741 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-20 11:20:29,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:29,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-20 11:20:29,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936220295] [2019-11-20 11:20:29,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:20:29,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:20:29,835 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-20 11:20:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:29,991 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-20 11:20:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:20:29,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-20 11:20:29,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:29,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2019-11-20 11:20:29,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:29,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:29,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-11-20 11:20:29,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:29,994 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 11:20:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-11-20 11:20:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-20 11:20:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 11:20:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-20 11:20:29,996 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 11:20:29,996 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 11:20:29,996 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 11:20:29,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-20 11:20:29,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:29,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:29,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:29,998 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2019-11-20 11:20:29,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:29,998 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-20 11:20:29,998 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-20 11:20:29,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:29,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2019-11-20 11:20:29,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:29,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621819983] [2019-11-20 11:20:29,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2019-11-20 11:20:30,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:30,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892623287] [2019-11-20 11:20:30,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2019-11-20 11:20:30,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:30,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913417972] [2019-11-20 11:20:30,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:30,232 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-20 11:20:30,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913417972] [2019-11-20 11:20:30,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669757429] [2019-11-20 11:20:30,232 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:30,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:20:30,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:30,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:20:30,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:30,326 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-20 11:20:30,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:30,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:30,343 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-20 11:20:30,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:30,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:30,351 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-20 11:20:30,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:30,387 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-20 11:20:30,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:30,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:30,396 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-20 11:20:30,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:30,434 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-20 11:20:30,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:30,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:30,444 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-20 11:20:30,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:30,491 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-20 11:20:30,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:30,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:30,497 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-20 11:20:30,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-20 11:20:30,516 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-20 11:20:30,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:30,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-20 11:20:30,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479402543] [2019-11-20 11:20:30,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:30,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 11:20:30,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:20:30,608 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-20 11:20:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:30,895 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-20 11:20:30,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:20:30,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-20 11:20:30,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:30,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2019-11-20 11:20:30,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:30,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:30,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-20 11:20:30,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:30,898 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-20 11:20:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-20 11:20:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-20 11:20:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 11:20:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-20 11:20:30,902 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-20 11:20:30,902 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-20 11:20:30,902 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 11:20:30,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-11-20 11:20:30,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:30,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:30,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:30,904 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2019-11-20 11:20:30,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:30,904 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-20 11:20:30,904 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-20 11:20:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2019-11-20 11:20:30,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:30,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853936337] [2019-11-20 11:20:30,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,959 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2019-11-20 11:20:30,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:30,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798467622] [2019-11-20 11:20:30,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:30,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2019-11-20 11:20:30,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:30,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623382732] [2019-11-20 11:20:30,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:31,169 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-20 11:20:31,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623382732] [2019-11-20 11:20:31,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344940718] [2019-11-20 11:20:31,170 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:31,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 11:20:31,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:31,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 11:20:31,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:31,250 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-20 11:20:31,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:31,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:31,273 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-20 11:20:31,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:31,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:31,279 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-20 11:20:31,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:31,313 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-20 11:20:31,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:31,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:31,321 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-20 11:20:31,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:31,348 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-20 11:20:31,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:31,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:31,354 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-20 11:20:31,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:31,388 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-20 11:20:31,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:31,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:31,398 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-20 11:20:31,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:31,429 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-20 11:20:31,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:31,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:31,440 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-20 11:20:31,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-20 11:20:31,464 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-20 11:20:31,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:31,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-20 11:20:31,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806711090] [2019-11-20 11:20:31,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:31,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:20:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:20:31,527 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-11-20 11:20:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:31,850 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-20 11:20:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:20:31,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-20 11:20:31,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:31,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2019-11-20 11:20:31,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:31,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:31,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-11-20 11:20:31,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:31,853 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-20 11:20:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-11-20 11:20:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-20 11:20:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 11:20:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-20 11:20:31,856 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-20 11:20:31,856 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-20 11:20:31,856 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 11:20:31,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-20 11:20:31,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:31,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:31,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:31,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2019-11-20 11:20:31,859 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:31,859 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-20 11:20:31,859 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-20 11:20:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2019-11-20 11:20:31,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:31,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191894058] [2019-11-20 11:20:31,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:31,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2019-11-20 11:20:31,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:31,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021106563] [2019-11-20 11:20:31,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:31,900 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2019-11-20 11:20:31,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:31,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838237606] [2019-11-20 11:20:31,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:32,099 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-20 11:20:32,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838237606] [2019-11-20 11:20:32,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040127171] [2019-11-20 11:20:32,100 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:32,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 11:20:32,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:32,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 11:20:32,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:32,170 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-20 11:20:32,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,178 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-20 11:20:32,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,184 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-20 11:20:32,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:32,218 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-20 11:20:32,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,227 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-20 11:20:32,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:32,271 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-20 11:20:32,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,281 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-20 11:20:32,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:32,315 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-20 11:20:32,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,320 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-20 11:20:32,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:32,367 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-20 11:20:32,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,375 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-20 11:20:32,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:32,405 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-20 11:20:32,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:32,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:32,409 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-20 11:20:32,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-20 11:20:32,430 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-20 11:20:32,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:32,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-20 11:20:32,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434629166] [2019-11-20 11:20:32,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:32,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 11:20:32,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-20 11:20:32,502 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-11-20 11:20:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:32,886 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-20 11:20:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 11:20:32,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2019-11-20 11:20:32,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:32,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2019-11-20 11:20:32,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:32,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:32,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2019-11-20 11:20:32,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:32,888 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-20 11:20:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2019-11-20 11:20:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 11:20:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 11:20:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-20 11:20:32,891 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-20 11:20:32,891 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-20 11:20:32,891 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 11:20:32,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2019-11-20 11:20:32,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:32,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:32,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:32,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2019-11-20 11:20:32,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:32,893 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-20 11:20:32,893 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-20 11:20:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2019-11-20 11:20:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:32,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699964438] [2019-11-20 11:20:32,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:32,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2019-11-20 11:20:32,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:32,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251644184] [2019-11-20 11:20:32,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:32,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:32,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2019-11-20 11:20:32,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:32,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149216751] [2019-11-20 11:20:32,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:33,121 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-20 11:20:33,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149216751] [2019-11-20 11:20:33,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631079007] [2019-11-20 11:20:33,122 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:33,196 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-20 11:20:33,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:33,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 11:20:33,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:33,214 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-20 11:20:33,215 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-20 11:20:33,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,222 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-20 11:20:33,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-20 11:20:33,247 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-20 11:20:33,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:33,270 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-20 11:20:33,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:33,302 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-20 11:20:33,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:33,343 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-20 11:20:33,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:33,365 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-20 11:20:33,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:33,397 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-20 11:20:33,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:33,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:33,399 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-20 11:20:33,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 11:20:33,425 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-20 11:20:33,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:33,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-11-20 11:20:33,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017338445] [2019-11-20 11:20:33,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 11:20:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-11-20 11:20:33,500 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand 22 states. [2019-11-20 11:20:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:33,962 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-20 11:20:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 11:20:33,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2019-11-20 11:20:33,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:33,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2019-11-20 11:20:33,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:33,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:33,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2019-11-20 11:20:33,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:33,965 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-20 11:20:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2019-11-20 11:20:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-20 11:20:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 11:20:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-20 11:20:33,968 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-20 11:20:33,968 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-20 11:20:33,968 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 11:20:33,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-11-20 11:20:33,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:33,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:33,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:33,970 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2019-11-20 11:20:33,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:33,970 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-20 11:20:33,970 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-20 11:20:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2019-11-20 11:20:33,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:33,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955945477] [2019-11-20 11:20:33,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:33,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2019-11-20 11:20:33,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:34,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725782670] [2019-11-20 11:20:34,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:34,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2019-11-20 11:20:34,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:34,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171211535] [2019-11-20 11:20:34,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:34,250 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-20 11:20:34,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171211535] [2019-11-20 11:20:34,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912083921] [2019-11-20 11:20:34,251 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:34,320 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-20 11:20:34,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:34,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 11:20:34,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:34,351 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-20 11:20:34,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,362 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-20 11:20:34,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,369 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-20 11:20:34,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,407 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-20 11:20:34,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,428 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-20 11:20:34,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,454 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-20 11:20:34,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,461 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-20 11:20:34,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,487 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-20 11:20:34,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,492 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-20 11:20:34,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,526 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-20 11:20:34,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,532 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-20 11:20:34,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,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-20 11:20:34,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,570 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-20 11:20:34,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,596 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-20 11:20:34,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,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-20 11:20:34,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:34,645 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-20 11:20:34,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:34,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:34,649 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-20 11:20:34,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-20 11:20:34,674 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-20 11:20:34,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:34,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2019-11-20 11:20:34,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976366715] [2019-11-20 11:20:34,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:34,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 11:20:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-11-20 11:20:34,751 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 25 states. [2019-11-20 11:20:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:35,319 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-20 11:20:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 11:20:35,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2019-11-20 11:20:35,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:35,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2019-11-20 11:20:35,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:35,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:35,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2019-11-20 11:20:35,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:35,324 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-20 11:20:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2019-11-20 11:20:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-20 11:20:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 11:20:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-20 11:20:35,329 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-20 11:20:35,329 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-20 11:20:35,329 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 11:20:35,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2019-11-20 11:20:35,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:35,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:35,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:35,331 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2019-11-20 11:20:35,331 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:35,331 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-20 11:20:35,332 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-20 11:20:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2019-11-20 11:20:35,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:35,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402860682] [2019-11-20 11:20:35,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:35,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2019-11-20 11:20:35,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:35,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111483600] [2019-11-20 11:20:35,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:35,369 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:35,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2019-11-20 11:20:35,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:35,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123289241] [2019-11-20 11:20:35,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:35,749 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-20 11:20:35,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123289241] [2019-11-20 11:20:35,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545055651] [2019-11-20 11:20:35,750 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:35,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 11:20:35,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:35,827 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-20 11:20:35,827 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-20 11:20:35,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:35,834 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-20 11:20:35,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-20 11:20:35,873 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-20 11:20:35,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:35,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:35,908 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-20 11:20:35,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:35,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:35,947 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-20 11:20:35,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:35,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:35,992 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-20 11:20:35,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:35,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:35,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:36,031 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-20 11:20:36,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:36,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:36,075 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-20 11:20:36,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:36,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:36,119 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-20 11:20:36,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:36,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:36,151 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-20 11:20:36,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:36,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:36,153 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-20 11:20:36,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 11:20:36,182 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-20 11:20:36,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:36,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-11-20 11:20:36,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580677925] [2019-11-20 11:20:36,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:36,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 11:20:36,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-11-20 11:20:36,259 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand 28 states. [2019-11-20 11:20:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:36,841 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-20 11:20:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 11:20:36,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-11-20 11:20:36,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:36,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2019-11-20 11:20:36,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:36,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:36,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2019-11-20 11:20:36,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:36,843 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-20 11:20:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2019-11-20 11:20:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 11:20:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 11:20:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-20 11:20:36,846 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-20 11:20:36,846 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-20 11:20:36,846 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 11:20:36,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-11-20 11:20:36,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:36,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:36,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:36,848 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2019-11-20 11:20:36,848 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:36,849 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-20 11:20:36,849 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-20 11:20:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2019-11-20 11:20:36,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:36,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429497461] [2019-11-20 11:20:36,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:36,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2019-11-20 11:20:36,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:36,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170201643] [2019-11-20 11:20:36,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:36,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2019-11-20 11:20:36,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:36,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754602108] [2019-11-20 11:20:36,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:37,164 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-20 11:20:37,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754602108] [2019-11-20 11:20:37,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926600667] [2019-11-20 11:20:37,165 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:37,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:20:37,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:37,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 11:20:37,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:37,230 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-20 11:20:37,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,239 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-20 11:20:37,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,245 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-20 11:20:37,245 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,273 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-20 11:20:37,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,288 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-20 11:20:37,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,314 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-20 11:20:37,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,320 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-20 11:20:37,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20: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-20 11:20:37,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,350 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-20 11:20:37,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,379 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-20 11:20:37,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,384 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-20 11:20:37,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,434 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-20 11:20:37,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,445 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-20 11:20:37,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,486 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-20 11:20:37,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,499 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-20 11:20:37,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,538 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-20 11:20:37,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,547 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-20 11:20:37,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,579 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-20 11:20:37,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,584 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-20 11:20:37,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:37,616 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-20 11:20:37,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:37,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:37,620 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-20 11:20:37,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-20 11:20:37,649 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-20 11:20:37,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:37,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2019-11-20 11:20:37,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552463863] [2019-11-20 11:20:37,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 11:20:37,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-11-20 11:20:37,700 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 31 states. [2019-11-20 11:20:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:38,564 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-20 11:20:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 11:20:38,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-11-20 11:20:38,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:38,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2019-11-20 11:20:38,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:38,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:38,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2019-11-20 11:20:38,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:38,567 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-20 11:20:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2019-11-20 11:20:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-20 11:20:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 11:20:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-20 11:20:38,569 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-20 11:20:38,569 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-20 11:20:38,570 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 11:20:38,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2019-11-20 11:20:38,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:38,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:38,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:38,571 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2019-11-20 11:20:38,571 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:38,571 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-20 11:20:38,571 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-20 11:20:38,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:38,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2019-11-20 11:20:38,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:38,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737949953] [2019-11-20 11:20:38,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:38,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:38,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:38,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2019-11-20 11:20:38,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:38,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539867651] [2019-11-20 11:20:38,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:38,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2019-11-20 11:20:38,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:38,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938128585] [2019-11-20 11:20:38,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:39,005 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-20 11:20:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938128585] [2019-11-20 11:20:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798116880] [2019-11-20 11:20:39,005 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:39,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-20 11:20:39,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:20:39,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 11:20:39,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:39,142 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-20 11:20:39,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,150 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-20 11:20:39,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,157 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-20 11:20:39,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,194 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-20 11:20:39,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,200 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-20 11:20:39,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,230 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-20 11:20:39,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,236 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-20 11:20:39,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,268 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-20 11:20:39,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,273 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-20 11:20:39,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,308 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-20 11:20:39,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,320 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-20 11:20:39,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,349 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-20 11:20:39,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,354 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-20 11:20:39,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,386 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-20 11:20:39,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,395 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-20 11:20:39,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,425 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-20 11:20:39,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,431 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-20 11:20:39,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,464 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-20 11:20:39,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,469 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-20 11:20:39,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,502 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-20 11:20:39,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,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-20 11:20:39,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-20 11:20:39,542 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-20 11:20:39,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:39,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:39,545 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-20 11:20:39,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-20 11:20:39,577 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-20 11:20:39,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:39,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2019-11-20 11:20:39,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445321420] [2019-11-20 11:20:39,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:39,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 11:20:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 11:20:39,625 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 34 states. [2019-11-20 11:20:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:40,558 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-20 11:20:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 11:20:40,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2019-11-20 11:20:40,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:40,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2019-11-20 11:20:40,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 11:20:40,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:40,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2019-11-20 11:20:40,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:40,561 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-20 11:20:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2019-11-20 11:20:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 11:20:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 11:20:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-20 11:20:40,563 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-20 11:20:40,564 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-20 11:20:40,564 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 11:20:40,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2019-11-20 11:20:40,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:40,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:40,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:40,565 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2019-11-20 11:20:40,565 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:40,565 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-20 11:20:40,565 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-20 11:20:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2019-11-20 11:20:40,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:40,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170727546] [2019-11-20 11:20:40,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:40,599 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2019-11-20 11:20:40,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:40,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404747322] [2019-11-20 11:20:40,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:40,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2019-11-20 11:20:40,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:40,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985401850] [2019-11-20 11:20:40,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:40,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:49,808 WARN L191 SmtUtils]: Spent 9.09 s on a formula simplification. DAG size of input: 204 DAG size of output: 172 [2019-11-20 11:20:49,879 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:20:49,879 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:20:49,879 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:20:49,879 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:20:49,879 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:20:49,879 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:49,879 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:20:49,879 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:20:49,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2019-11-20 11:20:49,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:20:49,879 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:20:49,882 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-20 11:20:49,884 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-20 11:20:49,886 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-20 11:20:49,887 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-20 11:20:49,889 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-20 11:20:50,080 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-20 11:20:50,082 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-20 11:20:50,084 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-20 11:20:50,086 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-20 11:20:50,088 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-20 11:20:50,090 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-20 11:20:50,092 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-20 11:20:50,094 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-20 11:20:50,096 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-20 11:20:50,386 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:20:50,386 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:50,393 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-20 11:20:50,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:20:50,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:20:50,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:20:50,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,408 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-20 11:20:50,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:20:50,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:20:50,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:20:50,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,423 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-20 11:20:50,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:20:50,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:20:50,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:20:50,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,431 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-20 11:20:50,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,445 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-20 11:20:50,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 11:20:50,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,488 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-20 11:20:50,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,502 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-20 11:20:50,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,517 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-20 11:20:50,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:50,527 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-20 11:20:50,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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) [2019-11-20 11:20:50,540 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:50,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:20:50,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:20:50,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:20:50,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:20:50,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:20:50,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:20:50,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:20:50,564 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-20 11:20:50,565 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_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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) [2019-11-20 11:20:50,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:20:50,571 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 11:20:50,571 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:20:50,572 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-20 11:20:50,599 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-11-20 11:20:50,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 11:20:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:50,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 11:20:50,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:50,667 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-20 11:20:50,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,682 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-20 11:20:50,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,690 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-20 11:20:50,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,722 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-20 11:20:50,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,731 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-20 11:20:50,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,760 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-20 11:20:50,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,770 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-20 11:20:50,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,801 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-20 11:20:50,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,810 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-20 11:20:50,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,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-20 11:20:50,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,857 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-20 11:20:50,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,889 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-20 11:20:50,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,897 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-20 11:20:50,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,947 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-20 11:20:50,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:50,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:50,955 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-20 11:20:50,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:50,991 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-20 11:20:50,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,004 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-20 11:20:51,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,055 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-20 11:20:51,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,068 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-20 11:20:51,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,119 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-20 11:20:51,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,128 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-20 11:20:51,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,172 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-20 11:20:51,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,186 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-20 11:20:51,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:51,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:20:51,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:51,255 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-20 11:20:51,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-20 11:20:51,322 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,323 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-20 11:20:51,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:51,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:51,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:51,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:51,328 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-20 11:20:51,387 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-20 11:20:51,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:51,388 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-20 11:20:51,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:65 [2019-11-20 11:20:51,437 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-20 11:20:51,437 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-20 11:20:51,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-20 11:20:51,525 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-20 11:20:51,525 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-20 11:20:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 11:20:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-20 11:20:51,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-20 11:20:51,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:51,525 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 11:20:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:51,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 11:20:51,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:51,606 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-20 11:20:51,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,627 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-20 11:20:51,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,640 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-20 11:20:51,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,671 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-20 11:20:51,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,680 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-20 11:20:51,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,712 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-20 11:20:51,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,728 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-20 11:20:51,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,768 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-20 11:20:51,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,784 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-20 11:20:51,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,822 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-20 11:20:51,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,836 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-20 11:20:51,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,871 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-20 11:20:51,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,879 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-20 11:20:51,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,914 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-20 11:20:51,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,923 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-20 11:20:51,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:51,966 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-20 11:20:51,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:51,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:51,978 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-20 11:20:51,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,013 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-20 11:20:52,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,022 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-20 11:20:52,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,065 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-20 11:20:52,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,076 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-20 11:20:52,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,124 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-20 11:20:52,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,138 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-20 11:20:52,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:52,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:20:52,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:52,192 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-20 11:20:52,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-20 11:20:52,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,282 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-20 11:20:52,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:52,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:52,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:52,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:52,286 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-20 11:20:52,340 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-20 11:20:52,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:52,341 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-20 11:20:52,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:65 [2019-11-20 11:20:52,399 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-20 11:20:52,399 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-20 11:20:52,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-20 11:20:52,484 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-20 11:20:52,486 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-20 11:20:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 11:20:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-11-20 11:20:52,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-20 11:20:52,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:52,487 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 11:20:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:52,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 11:20:52,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:52,550 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-20 11:20:52,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,559 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-20 11:20:52,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,566 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-20 11:20:52,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,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-20 11:20:52,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,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-20 11:20:52,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,640 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-20 11:20:52,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,649 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-20 11:20:52,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,679 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-20 11:20:52,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,688 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-20 11:20:52,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,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-20 11:20:52,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,733 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-20 11:20:52,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,766 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-20 11:20:52,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,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-20 11:20:52,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,814 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-20 11:20:52,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,827 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-20 11:20:52,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,863 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-20 11:20:52,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,870 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-20 11:20:52,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,897 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-20 11:20:52,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,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-20 11:20:52,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:52,939 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-20 11:20:52,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:52,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:52,952 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-20 11:20:52,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:53,086 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-20 11:20:53,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,095 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-20 11:20:53,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:53,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:20:53,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:53,151 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-20 11:20:53,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-20 11:20:53,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,218 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-20 11:20:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:53,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,221 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-20 11:20:53,273 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-20 11:20:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,276 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-20 11:20:53,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:86 [2019-11-20 11:20:53,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:53,402 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-20 11:20:53,402 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-20 11:20:53,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-20 11:20:53,725 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-20 11:20:53,725 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-20 11:20:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 11:20:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2019-11-20 11:20:53,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 53 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-20 11:20:53,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:53,727 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 11:20:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:53,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 11:20:53,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:53,795 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-20 11:20:53,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,810 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-20 11:20:53,811 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,822 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-20 11:20:53,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:53,850 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-20 11:20:53,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,866 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-20 11:20:53,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:53,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-20 11:20:53,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,903 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-20 11:20:53,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:53,931 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-20 11:20:53,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,940 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-20 11:20:53,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:53,978 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-20 11:20:53,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:53,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:53,988 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-20 11:20:53,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,023 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-20 11:20:54,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,032 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-20 11:20:54,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,066 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-20 11:20:54,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,075 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-20 11:20:54,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,118 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-20 11:20:54,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,128 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-20 11:20:54,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,211 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-20 11:20:54,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,228 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-20 11:20:54,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,271 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-20 11:20:54,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,282 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-20 11:20:54,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,324 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-20 11:20:54,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,334 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-20 11:20:54,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:20 [2019-11-20 11:20:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:54,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:20:54,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:54,382 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-20 11:20:54,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:54,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-11-20 11:20:54,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:54,449 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-20 11:20:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:54,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:54,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:54,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:54,452 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-20 11:20:54,508 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2019-11-20 11:20:54,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:54,510 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-20 11:20:54,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:65 [2019-11-20 11:20:54,561 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-20 11:20:54,561 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-20 11:20:54,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 15 states. [2019-11-20 11:20:54,967 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-20 11:20:54,968 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-20 11:20:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 11:20:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2019-11-20 11:20:54,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-20 11:20:54,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:54,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2019-11-20 11:20:54,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:54,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2019-11-20 11:20:54,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:20:54,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2019-11-20 11:20:54,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:54,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2019-11-20 11:20:54,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-20 11:20:54,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 11:20:54,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2019-11-20 11:20:54,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:20:54,974 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-20 11:20:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2019-11-20 11:20:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-11-20 11:20:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 11:20:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-20 11:20:54,977 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-20 11:20:54,977 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-20 11:20:54,977 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 11:20:54,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2019-11-20 11:20:54,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 11:20:54,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:20:54,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:20:54,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2019-11-20 11:20:54,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 11:20:54,978 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-20 11:20:54,978 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-20 11:20:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2019-11-20 11:20:54,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:54,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342474756] [2019-11-20 11:20:54,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:55,323 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-20 11:20:55,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342474756] [2019-11-20 11:20:55,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82691795] [2019-11-20 11:20:55,323 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4e51c28-1ec4-4259-8cb3-7d39e5968eef/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-20 11:20:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:55,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 11:20:55,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:55,402 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-20 11:20:55,402 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-20 11:20:55,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,410 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-20 11:20:55,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-20 11:20:55,451 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-20 11:20:55,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,489 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-20 11:20:55,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,517 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-20 11:20:55,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,549 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-20 11:20:55,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,580 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-20 11:20:55,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,617 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-20 11:20:55,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,663 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-20 11:20:55,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,712 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-20 11:20:55,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,766 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-20 11:20:55,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,821 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-20 11:20:55,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-20 11:20:55,862 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-20 11:20:55,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:20:55,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:55,863 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-20 11:20:55,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 11:20:55,867 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-20 11:20:55,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:20:55,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 36 [2019-11-20 11:20:55,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338548719] [2019-11-20 11:20:55,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:20:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:20:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2019-11-20 11:20:55,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:20:55,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376768760] [2019-11-20 11:20:55,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:20:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:20:55,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:20:55,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:20:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 11:20:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 11:20:55,952 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand 36 states. [2019-11-20 11:20:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:20:56,464 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-11-20 11:20:56,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-20 11:20:56,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2019-11-20 11:20:56,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 11:20:56,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-20 11:20:56,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 11:20:56,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 11:20:56,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 11:20:56,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:20:56,466 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:20:56,466 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:20:56,466 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:20:56,466 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 11:20:56,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 11:20:56,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 11:20:56,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 11:20:56,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 11:20:56 BoogieIcfgContainer [2019-11-20 11:20:56,472 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 11:20:56,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:20:56,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:20:56,472 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:20:56,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:20:26" (3/4) ... [2019-11-20 11:20:56,476 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:20:56,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:20:56,477 INFO L168 Benchmark]: Toolchain (without parser) took 30460.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 437.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:56,477 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:20:56,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:56,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:20:56,478 INFO L168 Benchmark]: Boogie Preprocessor took 21.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:56,478 INFO L168 Benchmark]: RCFGBuilder took 267.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:56,479 INFO L168 Benchmark]: BuchiAutomizer took 29574.97 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.7 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:56,479 INFO L168 Benchmark]: Witness Printer took 3.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:56,481 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29574.97 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 325.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.7 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. 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.5s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 19.5s. Construction of modules took 2.4s. Büchi inclusion checks took 7.3s. 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.4s 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: 22ms 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...