./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:05,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:05,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:05,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:05,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:05,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:05,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:05,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:05,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:05,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:05,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:05,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:05,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:05,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:05,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:05,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:05,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:05,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:05,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:05,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:05,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:05,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:05,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:05,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:05,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:05,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:05,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:05,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:05,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:05,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:05,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:05,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:05,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:05,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:05,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:05,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:05,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:05,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:05,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:05,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:05,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:05,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:05,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:05,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:05,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:05,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:05,233 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:05,233 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:05,234 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:05,234 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:05,234 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:05,234 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:05,234 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:05,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:05,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:05,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:05,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:05,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:05,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:05,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:05,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:05,236 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:05,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:05,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:05,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:05,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:05,240 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:05,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:05,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:05,241 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:05,243 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:05,243 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/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2019-10-22 08:59:05,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:05,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:05,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:05,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:05,299 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:05,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-10-22 08:59:05,356 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/data/af024d762/42117bc08b034ae385088b4d0811f790/FLAGb1bc8bd11 [2019-10-22 08:59:05,856 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:05,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-10-22 08:59:05,871 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/data/af024d762/42117bc08b034ae385088b4d0811f790/FLAGb1bc8bd11 [2019-10-22 08:59:06,162 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/data/af024d762/42117bc08b034ae385088b4d0811f790 [2019-10-22 08:59:06,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:06,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:06,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:06,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:06,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:06,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b8b389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06, skipping insertion in model container [2019-10-22 08:59:06,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,181 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:06,219 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:06,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:06,594 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:06,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:06,679 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:06,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06 WrapperNode [2019-10-22 08:59:06,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:06,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:06,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:06,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:06,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:06,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:06,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:06,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:06,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:06,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:06,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:06,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:06,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/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-10-22 08:59:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:07,091 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:07,091 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:59:07,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:07 BoogieIcfgContainer [2019-10-22 08:59:07,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:07,093 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:07,093 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:07,096 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:07,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:07,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:06" (1/3) ... [2019-10-22 08:59:07,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@564beb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:07, skipping insertion in model container [2019-10-22 08:59:07,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:07,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (2/3) ... [2019-10-22 08:59:07,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@564beb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:07, skipping insertion in model container [2019-10-22 08:59:07,100 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:07,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:07" (3/3) ... [2019-10-22 08:59:07,102 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-10-22 08:59:07,139 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:07,139 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:07,139 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:07,139 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:07,139 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:07,139 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:07,139 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:07,140 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:07,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:59:07,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:07,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,176 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:07,176 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:07,176 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:07,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:59:07,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:07,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:07,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:07,185 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2019-10-22 08:59:07,186 INFO L793 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2019-10-22 08:59:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:59:07,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803620538] [2019-10-22 08:59:07,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,345 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-10-22 08:59:07,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117926908] [2019-10-22 08:59:07,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,386 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-10-22 08:59:07,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047569714] [2019-10-22 08:59:07,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,519 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,855 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-22 08:59:08,281 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-10-22 08:59:08,417 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 08:59:08,427 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:08,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:08,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:08,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:08,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:08,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:08,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:08,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration1_Lasso [2019-10-22 08:59:08,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:08,429 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:08,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,866 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-22 08:59:09,033 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-22 08:59:09,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,330 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-10-22 08:59:09,841 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:59:09,991 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:10,000 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:10,002 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-10-22 08:59:10,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,010 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-10-22 08:59:10,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,011 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,012 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-10-22 08:59:10,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,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-10-22 08:59:10,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,031 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,031 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,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-10-22 08:59:10,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,055 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,057 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,079 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-10-22 08:59:10,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,089 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 08:59:10,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,098 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:59:10,101 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,186 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-10-22 08:59:10,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,195 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,197 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,237 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-10-22 08:59:10,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,250 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-10-22 08:59:10,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,251 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,279 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:10,299 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:10,300 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:10,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:10,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:10,304 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:10,305 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2019-10-22 08:59:10,391 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 08:59:10,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:10,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:10,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:10,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:59:10,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:10,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:10,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-10-22 08:59:10,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2019-10-22 08:59:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-10-22 08:59:10,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2019-10-22 08:59:10,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:10,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:59:10,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:10,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2019-10-22 08:59:10,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:10,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-10-22 08:59:10,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:10,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2019-10-22 08:59:10,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:59:10,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:59:10,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-10-22 08:59:10,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:10,642 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 08:59:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-10-22 08:59:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:59:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-10-22 08:59:10,669 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 08:59:10,669 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 08:59:10,669 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:10,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-10-22 08:59:10,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:10,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:10,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:10,671 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,671 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,671 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2019-10-22 08:59:10,672 INFO L793 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2019-10-22 08:59:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2019-10-22 08:59:10,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076132517] [2019-10-22 08:59:10,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076132517] [2019-10-22 08:59:10,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:10,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:10,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563832524] [2019-10-22 08:59:10,726 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-10-22 08:59:10,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336199587] [2019-10-22 08:59:10,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,944 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-22 08:59:10,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:10,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:10,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:10,982 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:10,999 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-10-22 08:59:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:11,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-10-22 08:59:11,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:11,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2019-10-22 08:59:11,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:59:11,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:59:11,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 08:59:11,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:11,004 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:59:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 08:59:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:59:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-10-22 08:59:11,006 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:59:11,006 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:59:11,006 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:11,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-10-22 08:59:11,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:11,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,011 INFO L791 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2019-10-22 08:59:11,011 INFO L793 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2019-10-22 08:59:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2019-10-22 08:59:11,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931976677] [2019-10-22 08:59:11,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:11,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931976677] [2019-10-22 08:59:11,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:11,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:11,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245792469] [2019-10-22 08:59:11,053 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-10-22 08:59:11,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562209999] [2019-10-22 08:59:11,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,315 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-22 08:59:11,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:11,369 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:59:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:11,388 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-10-22 08:59:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:11,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2019-10-22 08:59:11,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:11,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-10-22 08:59:11,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:59:11,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:59:11,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-10-22 08:59:11,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:11,390 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:59:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-10-22 08:59:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:59:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:59:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-22 08:59:11,392 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:59:11,392 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-22 08:59:11,392 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:11,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-10-22 08:59:11,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:11,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,394 INFO L791 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2019-10-22 08:59:11,394 INFO L793 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2019-10-22 08:59:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-10-22 08:59:11,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123643222] [2019-10-22 08:59:11,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,428 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2019-10-22 08:59:11,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582743473] [2019-10-22 08:59:11,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-10-22 08:59:11,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381164103] [2019-10-22 08:59:11,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:11,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381164103] [2019-10-22 08:59:11,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074766585] [2019-10-22 08:59:11,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab57ae5f-de3c-4c9e-a071-3c5eaca5c43f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:59:11,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:11,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:11,683 INFO L375 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 3 case distinctions, treesize of input 85 treesize of output 100 [2019-10-22 08:59:11,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:11,715 INFO L567 ElimStorePlain]: treesize reduction 55, result has 32.9 percent of original size [2019-10-22 08:59:11,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:11,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:24 [2019-10-22 08:59:11,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:11,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 08:59:11,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:11,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:11,747 INFO L375 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 28 treesize of output 20 [2019-10-22 08:59:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:11,751 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:11,757 INFO L567 ElimStorePlain]: treesize reduction 20, result has 13.0 percent of original size [2019-10-22 08:59:11,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:11,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2019-10-22 08:59:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:11,759 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:11,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-22 08:59:11,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943904274] [2019-10-22 08:59:11,944 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-22 08:59:11,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:11,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:59:11,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:11,995 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-10-22 08:59:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:12,094 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-22 08:59:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:12,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-10-22 08:59:12,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:12,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-10-22 08:59:12,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:59:12,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:59:12,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-10-22 08:59:12,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:12,097 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-22 08:59:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-10-22 08:59:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-10-22 08:59:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-22 08:59:12,098 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:59:12,098 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:59:12,098 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:12,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-10-22 08:59:12,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:12,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:12,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:12,098 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:12,098 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:12,099 INFO L791 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 412#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-10-22 08:59:12,099 INFO L793 eck$LassoCheckResult]: Loop: 414#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 417#L554-3 main_#t~short12 := main_#t~short10; 420#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 407#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 408#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-10-22 08:59:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 08:59:12,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678911831] [2019-10-22 08:59:12,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2019-10-22 08:59:12,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225750744] [2019-10-22 08:59:12,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2019-10-22 08:59:12,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649263931] [2019-10-22 08:59:12,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,187 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,410 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-10-22 08:59:12,546 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-22 08:59:12,754 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-10-22 08:59:13,020 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-22 08:59:13,023 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:13,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:13,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:13,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:13,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:13,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:13,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:13,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:13,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration5_Lasso [2019-10-22 08:59:13,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:13,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:13,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,561 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-10-22 08:59:13,677 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-22 08:59:13,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:14,244 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:59:14,408 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:14,408 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:14,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,412 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:14,412 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:14,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,425 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:14,425 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:14,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,430 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:14,430 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:14,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:14,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:14,436 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:14,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:14,439 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:14,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:14,440 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:14,440 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:14,441 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-10-22 08:59:14,529 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 08:59:14,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:59:14,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:14,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:14,581 INFO L375 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-10-22 08:59:14,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:14,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:14,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:14,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-10-22 08:59:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:14,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:14,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:14,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:14,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-10-22 08:59:14,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:14,732 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-10-22 08:59:14,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:14,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-10-22 08:59:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:14,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 08:59:14,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-10-22 08:59:14,817 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2019-10-22 08:59:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:59:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-10-22 08:59:14,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-10-22 08:59:14,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:59:14,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2019-10-22 08:59:14,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-10-22 08:59:14,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:14,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2019-10-22 08:59:14,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:59:14,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:14,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-10-22 08:59:14,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:14,821 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-22 08:59:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-10-22 08:59:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-10-22 08:59:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:59:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 08:59:14,822 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:59:14,822 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:59:14,822 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:14,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-10-22 08:59:14,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:59:14,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:14,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:14,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,824 INFO L791 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 623#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 624#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 625#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 629#L554-3 main_#t~short12 := main_#t~short10; 632#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 621#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 622#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 626#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-10-22 08:59:14,824 INFO L793 eck$LassoCheckResult]: Loop: 627#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 628#L554-3 main_#t~short12 := main_#t~short10; 631#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 619#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 633#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-10-22 08:59:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-10-22 08:59:14,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095802623] [2019-10-22 08:59:14,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,848 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-10-22 08:59:14,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153824180] [2019-10-22 08:59:14,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,861 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2019-10-22 08:59:14,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700655643] [2019-10-22 08:59:14,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:14,894 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:15,114 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-10-22 08:59:15,279 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-22 08:59:15,970 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-10-22 08:59:16,633 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-10-22 08:59:16,636 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:16,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:16,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:16,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:16,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:16,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:16,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:16,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:16,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration6_Lasso [2019-10-22 08:59:16,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:16,637 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:16,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:17,284 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-10-22 08:59:17,413 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-22 08:59:17,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:17,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:17,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:17,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:17,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:17,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:18,193 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:59:18,208 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:18,209 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:18,209 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-10-22 08:59:18,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,211 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-10-22 08:59:18,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,212 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,214 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-10-22 08:59:18,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,216 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-10-22 08:59:18,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,217 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,218 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-10-22 08:59:18,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,219 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,220 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,220 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,220 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-10-22 08:59:18,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,222 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,224 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-10-22 08:59:18,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,225 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,225 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,226 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-10-22 08:59:18,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,226 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,227 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,228 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-10-22 08:59:18,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,228 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,228 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,231 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-10-22 08:59:18,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,232 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-10-22 08:59:18,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,233 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,234 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,235 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-10-22 08:59:18,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,237 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-10-22 08:59:18,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:18,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:18,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:18,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,239 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-10-22 08:59:18,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,244 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-10-22 08:59:18,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,249 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-10-22 08:59:18,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,250 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,250 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,251 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-10-22 08:59:18,252 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:18,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:18,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:18,253 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:18,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:18,254 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-10-22 08:59:18,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:18,255 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:18,255 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:18,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:18,259 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 08:59:18,259 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:18,386 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:18,441 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:18,441 INFO L444 ModelExtractionUtils]: 33 out of 36 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:18,441 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:18,443 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 08:59:18,443 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:18,443 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2019-10-22 08:59:18,546 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 08:59:18,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:59:18,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:18,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,598 INFO L375 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-10-22 08:59:18,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-10-22 08:59:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:18,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:18,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:18,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-10-22 08:59:18,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,735 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-10-22 08:59:18,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:18,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-10-22 08:59:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:18,767 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 08:59:18,767 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-10-22 08:59:18,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-10-22 08:59:18,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:59:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-10-22 08:59:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:59:18,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:18,827 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:59:18,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:18,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,881 INFO L375 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-10-22 08:59:18,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:18,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-10-22 08:59:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:18,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:18,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:18,981 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:18,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-10-22 08:59:18,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,022 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-10-22 08:59:19,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:19,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-10-22 08:59:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:19,053 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 08:59:19,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-10-22 08:59:19,116 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-10-22 08:59:19,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:59:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-10-22 08:59:19,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:59:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,117 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:59:19,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:19,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:19,169 INFO L375 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-10-22 08:59:19,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:19,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-10-22 08:59:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:19,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:19,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:19,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:19,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-10-22 08:59:19,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:19,277 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-10-22 08:59:19,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:19,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-10-22 08:59:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:19,300 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-10-22 08:59:19,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-10-22 08:59:19,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2019-10-22 08:59:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:59:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-10-22 08:59:19,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-10-22 08:59:19,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:59:19,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-10-22 08:59:19,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:19,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-10-22 08:59:19,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:19,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-10-22 08:59:19,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:19,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:19,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:19,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:19,374 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:19,374 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:19,374 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:19,374 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:19,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:19,374 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:19,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:19,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:19 BoogieIcfgContainer [2019-10-22 08:59:19,380 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:19,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:19,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:19,381 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:19,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:07" (3/4) ... [2019-10-22 08:59:19,384 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:19,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:19,385 INFO L168 Benchmark]: Toolchain (without parser) took 13219.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -59.7 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,386 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,387 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:19,387 INFO L168 Benchmark]: RCFGBuilder took 347.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,387 INFO L168 Benchmark]: BuchiAutomizer took 12287.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.6 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:19,388 INFO L168 Benchmark]: Witness Printer took 4.31 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-10-22 08:59:19,392 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 513.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12287.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.6 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 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 - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 55 SDslu, 45 SDs, 0 SdLazy, 134 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1031 mio100 ax103 hnf99 lsp64 ukn56 mio100 lsp28 div100 bol104 ite100 ukn100 eq174 hnf88 smp97 dnf301 smp90 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 98ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...