./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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 0233d496bfaf5cb1311bfa260a57f41458184795 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:30:20,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:30:20,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:30:20,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:30:20,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:30:20,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:30:20,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:30:20,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:30:20,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:30:20,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:30:20,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:30:20,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:30:20,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:30:20,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:30:20,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:30:20,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:30:20,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:30:20,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:30:20,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:30:20,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:30:20,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:30:20,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:30:20,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:30:20,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:30:20,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:30:20,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:30:20,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:30:20,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:30:20,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:30:20,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:30:20,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:30:20,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:30:20,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:30:20,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:30:20,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:30:20,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:30:20,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:30:20,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:30:20,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:30:20,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:30:20,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:30:20,078 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-12-07 17:30:20,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:30:20,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:30:20,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:30:20,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:30:20,090 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:30:20,091 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 17:30:20,091 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 17:30:20,091 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 17:30:20,091 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 17:30:20,091 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 17:30:20,091 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 17:30:20,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:30:20,092 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 17:30:20,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 17:30:20,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:30:20,093 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 17:30:20,094 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 17:30:20,094 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_64ab4a9d-af32-4825-842f-1dbcffeb436b/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 -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-12-07 17:30:20,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:30:20,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:30:20,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:30:20,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:30:20,206 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:30:20,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-12-07 17:30:20,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/data/bf702de8b/a4e4aaad03c347058938d4f3a9084892/FLAG91bdf209b [2019-12-07 17:30:20,640 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:30:20,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-12-07 17:30:20,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/data/bf702de8b/a4e4aaad03c347058938d4f3a9084892/FLAG91bdf209b [2019-12-07 17:30:20,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/data/bf702de8b/a4e4aaad03c347058938d4f3a9084892 [2019-12-07 17:30:20,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:30:20,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:30:20,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:30:20,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:30:20,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:30:20,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc7a4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20, skipping insertion in model container [2019-12-07 17:30:20,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:30:20,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:30:20,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:30:20,796 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:30:20,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:30:20,852 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:30:20,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20 WrapperNode [2019-12-07 17:30:20,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:30:20,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:30:20,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:30:20,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:30:20,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:30:20,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:30:20,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:30:20,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:30:20,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... [2019-12-07 17:30:20,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:30:20,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:30:20,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:30:20,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:30:20,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:30:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:30:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:30:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:30:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:30:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:30:21,087 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:30:21,087 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 17:30:21,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:30:21 BoogieIcfgContainer [2019-12-07 17:30:21,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:30:21,088 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 17:30:21,089 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 17:30:21,091 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 17:30:21,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:30:21,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 05:30:20" (1/3) ... [2019-12-07 17:30:21,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32f475cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 05:30:21, skipping insertion in model container [2019-12-07 17:30:21,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:30:21,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:30:20" (2/3) ... [2019-12-07 17:30:21,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32f475cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 05:30:21, skipping insertion in model container [2019-12-07 17:30:21,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:30:21,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:30:21" (3/3) ... [2019-12-07 17:30:21,095 INFO L371 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-12-07 17:30:21,127 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 17:30:21,127 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 17:30:21,127 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 17:30:21,127 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:30:21,127 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:30:21,127 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 17:30:21,127 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:30:21,128 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 17:30:21,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-12-07 17:30:21,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 17:30:21,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:21,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:21,156 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 17:30:21,156 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:30:21,156 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 17:30:21,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-12-07 17:30:21,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 17:30:21,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:21,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:21,158 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 17:30:21,158 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:30:21,163 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2019-12-07 17:30:21,164 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2019-12-07 17:30:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:21,168 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 17:30:21,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:21,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512920333] [2019-12-07 17:30:21,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:21,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:21,312 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-12-07 17:30:21,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:21,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663184678] [2019-12-07 17:30:21,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:21,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-12-07 17:30:21,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:21,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138750428] [2019-12-07 17:30:21,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:21,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:21,891 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-12-07 17:30:22,092 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-07 17:30:22,101 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:30:22,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:30:22,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:30:22,102 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:30:22,102 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:30:22,102 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:22,102 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:30:22,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:30:22,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2019-12-07 17:30:22,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:30:22,103 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:30:22,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,531 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-12-07 17:30:22,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:22,948 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:30:22,951 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:22,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:22,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:22,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:22,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:22,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:22,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:22,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:22,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:22,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:22,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:22,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:22,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:22,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:22,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:22,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:22,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:22,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:22,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:22,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:22,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:22,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:22,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:22,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:22,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:22,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:22,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:22,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:22,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:22,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:22,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:22,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:22,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:22,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:22,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_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:22,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:22,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:22,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:22,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:22,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:23,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:23,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:23,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:23,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:23,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:23,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:23,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:23,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:23,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:30:23,175 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-12-07 17:30:23,175 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:23,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:30:23,181 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:30:23,181 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:30:23,182 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2019-12-07 17:30:23,295 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-12-07 17:30:23,303 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:30:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:23,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:30:23,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:23,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:30:23,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:23,367 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 17:30:23,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-12-07 17:30:23,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2019-12-07 17:30:23,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 17:30:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:30:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-12-07 17:30:23,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2019-12-07 17:30:23,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:23,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-12-07 17:30:23,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:23,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2019-12-07 17:30:23,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:23,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-12-07 17:30:23,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 17:30:23,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2019-12-07 17:30:23,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-12-07 17:30:23,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-12-07 17:30:23,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-12-07 17:30:23,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:23,420 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 17:30:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-12-07 17:30:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 17:30:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 17:30:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-12-07 17:30:23,445 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 17:30:23,445 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-12-07 17:30:23,445 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 17:30:23,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-12-07 17:30:23,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-12-07 17:30:23,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:23,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:23,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 17:30:23,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 17:30:23,447 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-12-07 17:30:23,447 INFO L796 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-12-07 17:30:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-12-07 17:30:23,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:23,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76843916] [2019-12-07 17:30:23,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:23,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76843916] [2019-12-07 17:30:23,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:30:23,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:30:23,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547733997] [2019-12-07 17:30:23,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:30:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2019-12-07 17:30:23,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:23,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294851076] [2019-12-07 17:30:23,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:23,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:23,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:30:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:30:23,592 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-12-07 17:30:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:23,650 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-12-07 17:30:23,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:30:23,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-12-07 17:30:23,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-12-07 17:30:23,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2019-12-07 17:30:23,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-12-07 17:30:23,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-12-07 17:30:23,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-12-07 17:30:23,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:23,652 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-12-07 17:30:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-12-07 17:30:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-12-07 17:30:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 17:30:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-12-07 17:30:23,654 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 17:30:23,654 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 17:30:23,654 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 17:30:23,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-12-07 17:30:23,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-12-07 17:30:23,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:23,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:23,655 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-12-07 17:30:23,655 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 17:30:23,655 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 288#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 289#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 293#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 294#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 297#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 300#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 301#L20 [2019-12-07 17:30:23,655 INFO L796 eck$LassoCheckResult]: Loop: 301#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 292#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 295#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 303#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 301#L20 [2019-12-07 17:30:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-12-07 17:30:23,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:23,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489600563] [2019-12-07 17:30:23,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:23,681 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2019-12-07 17:30:23,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:23,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104799191] [2019-12-07 17:30:23,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:23,689 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2019-12-07 17:30:23,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:23,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307142587] [2019-12-07 17:30:23,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307142587] [2019-12-07 17:30:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953643685] [2019-12-07 17:30:23,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:23,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:30:23,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:23,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:23,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 17:30:23,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:23,826 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-12-07 17:30:23,833 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 11 treesize of output 7 [2019-12-07 17:30:23,833 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:23,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 17:30:23,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-12-07 17:30:23,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:23,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-12-07 17:30:23,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:23,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:30:23,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:23,881 INFO L534 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-12-07 17:30:23,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-12-07 17:30:23,901 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 22 treesize of output 10 [2019-12-07 17:30:23,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:23,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:23,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 17:30:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:23,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:30:23,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-12-07 17:30:23,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740551475] [2019-12-07 17:30:23,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:23,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:30:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:30:23,981 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-12-07 17:30:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:24,103 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-12-07 17:30:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:30:24,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-12-07 17:30:24,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-12-07 17:30:24,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2019-12-07 17:30:24,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 17:30:24,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 17:30:24,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-12-07 17:30:24,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:30:24,105 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 17:30:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-12-07 17:30:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2019-12-07 17:30:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 17:30:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-12-07 17:30:24,106 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-12-07 17:30:24,107 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-12-07 17:30:24,107 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 17:30:24,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-12-07 17:30:24,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-12-07 17:30:24,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:24,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:24,107 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 17:30:24,107 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-12-07 17:30:24,108 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 383#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 384#L24-2 [2019-12-07 17:30:24,108 INFO L796 eck$LassoCheckResult]: Loop: 384#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 388#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 386#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 387#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 393#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 392#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 391#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 384#L24-2 [2019-12-07 17:30:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:24,108 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-12-07 17:30:24,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:24,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009165791] [2019-12-07 17:30:24,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:24,132 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2019-12-07 17:30:24,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:24,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285188338] [2019-12-07 17:30:24,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:24,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:24,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:24,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2019-12-07 17:30:24,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:24,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348074772] [2019-12-07 17:30:24,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:24,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:24,282 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-12-07 17:30:24,736 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-12-07 17:30:24,913 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-07 17:30:24,916 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:30:24,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:30:24,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:30:24,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:30:24,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:30:24,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:24,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:30:24,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:30:24,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2019-12-07 17:30:24,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:30:24,916 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:30:24,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:24,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,248 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-12-07 17:30:25,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:25,676 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:30:25,676 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:25,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:25,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:25,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:25,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:25,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:25,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:25,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:25,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:25,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:25,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:25,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:25,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:25,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:25,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:25,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:25,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:25,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:25,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:25,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:25,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:25,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:25,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:25,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:25,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:25,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:25,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:25,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:25,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:25,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:25,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:25,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:25,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:25,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:25,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:25,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:25,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:25,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:25,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:25,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:25,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:30:25,732 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 17:30:25,732 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/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-12-07 17:30:25,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:30:25,736 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:30:25,736 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:30:25,736 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2019-12-07 17:30:25,854 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-12-07 17:30:25,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:30:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:25,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:30:25,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:25,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:30:25,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:25,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:25,909 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 30 treesize of output 61 [2019-12-07 17:30:25,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:25,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:25,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:25,940 INFO L614 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-12-07 17:30:25,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:25,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:40 [2019-12-07 17:30:25,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:25,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:25,968 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 19 treesize of output 11 [2019-12-07 17:30:25,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:25,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:25,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 1 case distinctions, treesize of input 30 treesize of output 25 [2019-12-07 17:30:25,978 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:25,983 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 30 treesize of output 25 [2019-12-07 17:30:25,983 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:26,005 INFO L614 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-12-07 17:30:26,006 INFO L534 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-12-07 17:30:26,006 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-12-07 17:30:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:26,026 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-12-07 17:30:26,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-12-07 17:30:26,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2019-12-07 17:30:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-12-07 17:30:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-12-07 17:30:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-12-07 17:30:26,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-12-07 17:30:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:26,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-12-07 17:30:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:26,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-12-07 17:30:26,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:26,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-12-07 17:30:26,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-12-07 17:30:26,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 17:30:26,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 17:30:26,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 17:30:26,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-12-07 17:30:26,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:26,099 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 17:30:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-12-07 17:30:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 17:30:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 17:30:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 17:30:26,101 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 17:30:26,101 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 17:30:26,101 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 17:30:26,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-12-07 17:30:26,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-12-07 17:30:26,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:26,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:26,102 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 17:30:26,103 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 17:30:26,103 INFO L794 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 650#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 651#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 662#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 663#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 675#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 674#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 673#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 665#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 660#L24 [2019-12-07 17:30:26,103 INFO L796 eck$LassoCheckResult]: Loop: 660#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 657#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 658#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 671#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 670#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 660#L24 [2019-12-07 17:30:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2019-12-07 17:30:26,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:26,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545766065] [2019-12-07 17:30:26,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:26,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545766065] [2019-12-07 17:30:26,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830133444] [2019-12-07 17:30:26,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:26,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 17:30:26,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:26,277 INFO L343 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2019-12-07 17:30:26,278 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 3 case distinctions, treesize of input 123 treesize of output 29 [2019-12-07 17:30:26,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:26,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:26,286 INFO L534 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-12-07 17:30:26,286 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:38 [2019-12-07 17:30:26,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:26,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 17:30:26,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:26,356 INFO L614 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-12-07 17:30:26,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:26,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2019-12-07 17:30:26,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:26,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:26,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:26,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2019-12-07 17:30:26,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:26,490 INFO L614 ElimStorePlain]: treesize reduction 22, result has 12.0 percent of original size [2019-12-07 17:30:26,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:26,490 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-12-07 17:30:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:26,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:30:26,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 17:30:26,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675464446] [2019-12-07 17:30:26,492 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:30:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2019-12-07 17:30:26,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:26,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287660601] [2019-12-07 17:30:26,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:26,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:26,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:30:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:30:26,608 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-12-07 17:30:26,931 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-12-07 17:30:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:27,085 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-12-07 17:30:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:30:27,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-12-07 17:30:27,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-12-07 17:30:27,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-12-07 17:30:27,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 17:30:27,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 17:30:27,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-12-07 17:30:27,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:27,088 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-12-07 17:30:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-12-07 17:30:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-12-07 17:30:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 17:30:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 17:30:27,090 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 17:30:27,090 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 17:30:27,090 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 17:30:27,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-12-07 17:30:27,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-12-07 17:30:27,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:27,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:27,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-12-07 17:30:27,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 17:30:27,091 INFO L794 eck$LassoCheckResult]: Stem: 775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 769#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 770#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 780#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 774#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 789#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 786#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 785#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 778#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 790#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 794#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 793#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 792#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 784#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 781#L24 [2019-12-07 17:30:27,091 INFO L796 eck$LassoCheckResult]: Loop: 781#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 776#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 777#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 788#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 781#L24 [2019-12-07 17:30:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2019-12-07 17:30:27,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021846667] [2019-12-07 17:30:27,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2019-12-07 17:30:27,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650644713] [2019-12-07 17:30:27,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2019-12-07 17:30:27,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001042293] [2019-12-07 17:30:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:30:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001042293] [2019-12-07 17:30:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355302963] [2019-12-07 17:30:27,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:27,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 17:30:27,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:27,259 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-12-07 17:30:27,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,263 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,263 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-12-07 17:30:27,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:30:27,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 17:30:27,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 17:30:27,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-12-07 17:30:27,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:30:27,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,317 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 17:30:27,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:30:27,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,339 INFO L534 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-12-07 17:30:27,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-12-07 17:30:27,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:27,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 17:30:27,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:27,363 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:27,363 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-12-07 17:30:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:30:27,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:30:27,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-12-07 17:30:27,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334861904] [2019-12-07 17:30:27,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:27,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:30:27,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:30:27,481 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2019-12-07 17:30:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:27,766 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-12-07 17:30:27,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:30:27,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2019-12-07 17:30:27,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-12-07 17:30:27,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 43 transitions. [2019-12-07 17:30:27,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-12-07 17:30:27,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-12-07 17:30:27,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2019-12-07 17:30:27,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:27,768 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-12-07 17:30:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2019-12-07 17:30:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-12-07 17:30:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 17:30:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-12-07 17:30:27,770 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-12-07 17:30:27,770 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-12-07 17:30:27,770 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 17:30:27,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 34 transitions. [2019-12-07 17:30:27,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-12-07 17:30:27,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:27,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:27,771 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-12-07 17:30:27,771 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-12-07 17:30:27,772 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 941#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 942#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 948#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 945#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 946#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 966#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 958#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 956#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 949#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 950#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 971#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 970#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 969#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 968#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 957#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L24 [2019-12-07 17:30:27,772 INFO L796 eck$LassoCheckResult]: Loop: 951#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 953#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 954#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 943#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 944#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 967#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 964#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 965#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L24 [2019-12-07 17:30:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2019-12-07 17:30:27,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306445164] [2019-12-07 17:30:27,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,800 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2019-12-07 17:30:27,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319760385] [2019-12-07 17:30:27,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:30:27,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319760385] [2019-12-07 17:30:27,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:30:27,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:30:27,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857892168] [2019-12-07 17:30:27,812 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 17:30:27,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:30:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:30:27,812 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-12-07 17:30:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:27,835 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-12-07 17:30:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:30:27,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2019-12-07 17:30:27,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-12-07 17:30:27,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2019-12-07 17:30:27,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-12-07 17:30:27,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-12-07 17:30:27,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-12-07 17:30:27,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:27,837 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-12-07 17:30:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-12-07 17:30:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 17:30:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 17:30:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-12-07 17:30:27,838 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-12-07 17:30:27,838 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-12-07 17:30:27,838 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 17:30:27,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2019-12-07 17:30:27,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-12-07 17:30:27,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:27,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:27,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-12-07 17:30:27,839 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2019-12-07 17:30:27,840 INFO L794 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1014#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1015#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1031#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1019#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1020#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1023#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1026#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1028#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1029#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1032#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1044#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1043#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1042#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1041#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1030#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1024#L24 [2019-12-07 17:30:27,840 INFO L796 eck$LassoCheckResult]: Loop: 1024#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1025#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1037#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1036#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1035#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1034#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1033#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1027#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1021#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1022#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1017#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1018#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1040#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1038#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1039#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1024#L24 [2019-12-07 17:30:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2019-12-07 17:30:27,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921629188] [2019-12-07 17:30:27,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2019-12-07 17:30:27,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729504308] [2019-12-07 17:30:27,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2019-12-07 17:30:27,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:27,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400086738] [2019-12-07 17:30:27,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:27,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:28,421 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2019-12-07 17:30:28,565 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 17:30:31,102 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 195 DAG size of output: 158 [2019-12-07 17:30:31,802 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-07 17:30:31,806 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:30:31,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:30:31,807 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:30:31,807 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:30:31,807 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:30:31,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:31,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:30:31,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:30:31,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration8_Lasso [2019-12-07 17:30:31,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:30:31,807 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:30:31,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:31,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:32,365 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-07 17:30:32,484 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-12-07 17:30:32,863 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:30:32,863 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:32,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:32,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:32,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:32,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:32,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:32,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:32,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:32,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:32,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:32,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:32,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:32,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:32,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:32,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:32,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:32,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:32,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:32,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:32,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:32,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:33,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:33,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:33,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:33,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:33,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:33,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:33,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:33,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:33,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:33,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:33,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:33,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:33,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:33,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:33,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:33,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:33,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:33,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:33,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:30:33,038 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-12-07 17:30:33,038 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:33,042 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:30:33,044 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:30:33,044 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:30:33,044 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2019-12-07 17:30:33,186 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-12-07 17:30:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:33,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:30:33,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:33,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:30:33,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:33,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:30:33,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,230 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:30:33,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,262 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 26 treesize of output 57 [2019-12-07 17:30:33,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,280 INFO L614 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-12-07 17:30:33,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-12-07 17:30:33,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,304 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 1 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 17:30:33,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,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 26 treesize of output 21 [2019-12-07 17:30:33,308 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,325 INFO L614 ElimStorePlain]: treesize reduction 38, result has 43.3 percent of original size [2019-12-07 17:30:33,325 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,325 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:29 [2019-12-07 17:30:33,396 INFO L343 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-12-07 17:30:33,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-12-07 17:30:33,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,429 INFO L614 ElimStorePlain]: treesize reduction 40, result has 53.5 percent of original size [2019-12-07 17:30:33,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:46 [2019-12-07 17:30:33,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:33,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-12-07 17:30:33,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,507 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 1 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 17:30:33,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 103 [2019-12-07 17:30:33,548 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,553 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 26 treesize of output 21 [2019-12-07 17:30:33,554 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,656 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-12-07 17:30:33,657 INFO L614 ElimStorePlain]: treesize reduction 178, result has 32.3 percent of original size [2019-12-07 17:30:33,657 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:30:33,657 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:85 [2019-12-07 17:30:33,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:33,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:33,725 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 67 [2019-12-07 17:30:33,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2019-12-07 17:30:33,754 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2019-12-07 17:30:33,780 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:33,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 67 [2019-12-07 17:30:33,802 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:33,859 INFO L614 ElimStorePlain]: treesize reduction 162, result has 33.9 percent of original size [2019-12-07 17:30:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:33,860 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 17:30:33,860 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:83 [2019-12-07 17:30:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:33,907 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-12-07 17:30:33,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-12-07 17:30:34,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 46 states and 50 transitions. Complement of second has 22 states. [2019-12-07 17:30:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-12-07 17:30:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 17:30:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-12-07 17:30:34,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2019-12-07 17:30:34,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:34,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2019-12-07 17:30:34,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:34,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2019-12-07 17:30:34,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:34,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2019-12-07 17:30:34,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 17:30:34,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2019-12-07 17:30:34,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 17:30:34,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-12-07 17:30:34,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2019-12-07 17:30:34,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:34,257 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-12-07 17:30:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2019-12-07 17:30:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-12-07 17:30:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 17:30:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-12-07 17:30:34,259 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-12-07 17:30:34,259 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-12-07 17:30:34,259 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 17:30:34,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-12-07 17:30:34,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 17:30:34,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:34,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:34,260 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 17:30:34,260 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-12-07 17:30:34,260 INFO L794 eck$LassoCheckResult]: Stem: 1415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1409#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1410#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1422#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1413#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1414#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1443#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1441#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1424#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1425#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1438#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1436#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1434#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1432#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1430#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1428#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1420#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1416#L24-2 [2019-12-07 17:30:34,261 INFO L796 eck$LassoCheckResult]: Loop: 1416#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1417#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1411#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1412#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1447#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1446#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1423#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1416#L24-2 [2019-12-07 17:30:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2019-12-07 17:30:34,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:34,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459094722] [2019-12-07 17:30:34,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:34,278 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2019-12-07 17:30:34,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:34,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901770805] [2019-12-07 17:30:34,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:34,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2019-12-07 17:30:34,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:34,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241601545] [2019-12-07 17:30:34,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:34,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:37,243 WARN L192 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 200 DAG size of output: 149 [2019-12-07 17:30:37,728 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-12-07 17:30:37,731 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:30:37,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:30:37,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:30:37,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:30:37,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:30:37,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:37,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:30:37,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:30:37,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2019-12-07 17:30:37,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:30:37,732 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:30:37,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:37,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:37,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:37,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:37,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:38,201 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 17:30:38,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:38,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:38,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:30:38,573 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:30:38,573 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:38,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:38,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:38,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:38,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:38,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:38,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:38,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:38,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:38,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:38,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:38,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:38,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:38,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:38,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:38,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:38,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:38,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:38,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:38,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:38,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:30:38,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:38,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:38,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:38,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:30:38,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:30:38,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:38,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:38,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:38,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:38,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:38,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:38,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:38,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:38,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:38,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:30:38,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:30:38,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:30:38,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:30:38,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:30:38,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:30:38,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:30:38,612 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:30:38,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 17:30:38,616 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:30:38,618 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:30:38,619 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:30:38,620 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:30:38,620 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2019-12-07 17:30:38,726 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-12-07 17:30:38,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 17:30:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:38,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:30:38,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:38,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:30:38,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:38,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:38,780 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 30 treesize of output 61 [2019-12-07 17:30:38,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:38,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:38,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:38,808 INFO L614 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-12-07 17:30:38,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:38,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:40 [2019-12-07 17:30:38,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:38,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:38,837 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 19 treesize of output 11 [2019-12-07 17:30:38,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:38,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:38,846 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 1 case distinctions, treesize of input 30 treesize of output 25 [2019-12-07 17:30:38,846 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:38,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-12-07 17:30:38,851 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:38,872 INFO L614 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-12-07 17:30:38,873 INFO L534 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-12-07 17:30:38,873 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-12-07 17:30:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:30:38,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-12-07 17:30:38,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-12-07 17:30:38,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2019-12-07 17:30:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-12-07 17:30:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-12-07 17:30:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-12-07 17:30:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-12-07 17:30:38,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2019-12-07 17:30:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2019-12-07 17:30:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:30:38,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2019-12-07 17:30:38,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 17:30:38,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2019-12-07 17:30:38,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 17:30:38,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 17:30:38,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2019-12-07 17:30:38,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:30:38,961 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-12-07 17:30:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2019-12-07 17:30:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-12-07 17:30:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 17:30:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-12-07 17:30:38,963 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-12-07 17:30:38,963 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-12-07 17:30:38,963 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 17:30:38,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2019-12-07 17:30:38,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-12-07 17:30:38,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:30:38,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:30:38,965 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2019-12-07 17:30:38,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-12-07 17:30:38,965 INFO L794 eck$LassoCheckResult]: Stem: 1785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1783#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1784#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1790#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1815#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1814#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1813#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1812#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1811#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1810#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1797#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1786#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1787#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1806#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1804#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1802#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1793#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1791#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1792#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1788#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1789#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1835#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1834#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1828#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1827#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1826#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1825#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1824#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1823#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1822#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1801#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1794#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1795#L24-2 [2019-12-07 17:30:38,965 INFO L796 eck$LassoCheckResult]: Loop: 1795#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1809#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1808#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1807#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1805#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1803#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1798#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1795#L24-2 [2019-12-07 17:30:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2019-12-07 17:30:38,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:38,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711641652] [2019-12-07 17:30:38,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 17:30:39,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711641652] [2019-12-07 17:30:39,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147246366] [2019-12-07 17:30:39,141 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64ab4a9d-af32-4825-842f-1dbcffeb436b/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:30:39,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-07 17:30:39,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:30:39,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 17:30:39,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:39,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:30:39,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 17:30:39,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-12-07 17:30:39,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 17:30:39,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,249 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-12-07 17:30:39,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:30:39,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,281 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,282 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,282 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 17:30:39,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,335 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 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 17:30:39,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,353 INFO L614 ElimStorePlain]: treesize reduction 16, result has 66.7 percent of original size [2019-12-07 17:30:39,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,353 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2019-12-07 17:30:39,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 17:30:39,381 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,397 INFO L614 ElimStorePlain]: treesize reduction 4, result has 89.7 percent of original size [2019-12-07 17:30:39,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,397 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-12-07 17:30:39,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2019-12-07 17:30:39,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,458 INFO L614 ElimStorePlain]: treesize reduction 32, result has 52.2 percent of original size [2019-12-07 17:30:39,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2019-12-07 17:30:39,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-12-07 17:30:39,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,531 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-12-07 17:30:39,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:43 [2019-12-07 17:30:39,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 17:30:39,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,583 INFO L614 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-12-07 17:30:39,583 INFO L534 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-12-07 17:30:39,583 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:32 [2019-12-07 17:30:39,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:39,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:39,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-12-07 17:30:39,616 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,624 INFO L614 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-12-07 17:30:39,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:39,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 17:30:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:30:39,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:30:39,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2019-12-07 17:30:39,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432547533] [2019-12-07 17:30:39,640 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:30:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2019-12-07 17:30:39,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:30:39,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850486006] [2019-12-07 17:30:39,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:30:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:30:39,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:30:39,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:30:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:30:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:30:39,763 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 22 states. [2019-12-07 17:30:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:40,429 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-12-07 17:30:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:30:40,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 44 transitions. [2019-12-07 17:30:40,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 17:30:40,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-12-07 17:30:40,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 17:30:40,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 17:30:40,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 17:30:40,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:30:40,430 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:30:40,430 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:30:40,430 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:30:40,430 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 17:30:40,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:30:40,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 17:30:40,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 17:30:40,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 05:30:40 BoogieIcfgContainer [2019-12-07 17:30:40,435 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 17:30:40,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:30:40,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:30:40,435 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:30:40,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:30:21" (3/4) ... [2019-12-07 17:30:40,437 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:30:40,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:30:40,438 INFO L168 Benchmark]: Toolchain (without parser) took 19780.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.6 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -55.8 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:40,438 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:30:40,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:40,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:30:40,439 INFO L168 Benchmark]: Boogie Preprocessor took 15.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:40,439 INFO L168 Benchmark]: RCFGBuilder took 194.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:40,439 INFO L168 Benchmark]: BuchiAutomizer took 19346.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.6 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:30:40,439 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:30:40,441 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 194.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19346.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.6 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.3s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 15.8s. Construction of modules took 0.6s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 47 SDtfs, 99 SDslu, 49 SDs, 0 SdLazy, 766 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1981 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...