./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-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_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:01:25,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:25,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:25,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:25,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:25,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:25,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:25,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:25,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:25,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:25,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:25,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:25,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:25,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:25,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:25,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:25,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:25,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:25,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:25,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:25,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:25,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:25,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:25,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:25,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:25,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:25,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:25,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:25,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:25,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:25,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:25,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:25,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:25,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:25,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:25,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:25,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:25,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:25,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:25,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:25,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:25,067 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:25,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:25,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:25,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:25,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:25,092 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:25,093 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:25,093 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:25,093 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:25,093 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:25,093 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:25,094 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:25,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:25,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:25,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:25,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:25,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:25,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:25,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:25,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:25,095 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:25,096 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:25,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:25,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:25,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:25,096 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:25,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:25,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:25,097 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:25,098 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:25,102 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_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2019-10-22 09:01:25,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:25,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:25,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:25,173 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:25,173 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:25,174 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2019-10-22 09:01:25,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/data/5a1cb92e5/ee8ead03899f4ca18e89fe3f0798fa43/FLAG9162568df [2019-10-22 09:01:25,755 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:25,758 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2019-10-22 09:01:25,779 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/data/5a1cb92e5/ee8ead03899f4ca18e89fe3f0798fa43/FLAG9162568df [2019-10-22 09:01:26,038 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/data/5a1cb92e5/ee8ead03899f4ca18e89fe3f0798fa43 [2019-10-22 09:01:26,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:26,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:26,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:26,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:26,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:26,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c0f519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26, skipping insertion in model container [2019-10-22 09:01:26,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,062 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:26,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:26,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:26,553 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:26,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:26,657 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:26,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26 WrapperNode [2019-10-22 09:01:26,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:26,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:26,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:26,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:26,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:26,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:26,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:26,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:26,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... [2019-10-22 09:01:26,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:26,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:26,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:26,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:26,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/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 09:01:26,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:26,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:26,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:26,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:26,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:26,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:27,004 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:27,004 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:27,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:27 BoogieIcfgContainer [2019-10-22 09:01:27,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:27,006 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:27,006 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:27,009 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:27,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:27,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:26" (1/3) ... [2019-10-22 09:01:27,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5adacdfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:27, skipping insertion in model container [2019-10-22 09:01:27,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:27,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:26" (2/3) ... [2019-10-22 09:01:27,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5adacdfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:27, skipping insertion in model container [2019-10-22 09:01:27,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:27,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:27" (3/3) ... [2019-10-22 09:01:27,013 INFO L371 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca.i [2019-10-22 09:01:27,060 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:27,070 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:27,070 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:27,070 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:27,070 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:27,071 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:27,071 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:27,071 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:27,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:01:27,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:01:27,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:27,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:27,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:27,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:27,148 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:27,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:01:27,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:01:27,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:27,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:27,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:27,150 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:27,158 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 12#L553-3true [2019-10-22 09:01:27,158 INFO L793 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2019-10-22 09:01:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:01:27,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189862701] [2019-10-22 09:01:27,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,309 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2019-10-22 09:01:27,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625300697] [2019-10-22 09:01:27,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,343 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 09:01:27,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625300697] [2019-10-22 09:01:27,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:27,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103630156] [2019-10-22 09:01:27,348 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:27,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:27,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:27,362 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-10-22 09:01:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,367 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-10-22 09:01:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:27,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 09:01:27,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:01:27,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2019-10-22 09:01:27,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:01:27,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:01:27,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-10-22 09:01:27,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:27,374 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 09:01:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-10-22 09:01:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 09:01:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 09:01:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-10-22 09:01:27,395 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 09:01:27,395 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 09:01:27,396 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:27,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-10-22 09:01:27,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:01:27,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:27,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:27,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:27,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:27,397 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 37#L553-3 [2019-10-22 09:01:27,397 INFO L793 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2019-10-22 09:01:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:01:27,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111213222] [2019-10-22 09:01:27,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,428 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2019-10-22 09:01:27,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332929229] [2019-10-22 09:01:27,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,489 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 09:01:27,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332929229] [2019-10-22 09:01:27,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:27,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873043546] [2019-10-22 09:01:27,490 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:27,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:27,491 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-10-22 09:01:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,562 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-10-22 09:01:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:27,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-10-22 09:01:27,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 09:01:27,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2019-10-22 09:01:27,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 09:01:27,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 09:01:27,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-10-22 09:01:27,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:27,565 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 09:01:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-10-22 09:01:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-10-22 09:01:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:01:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-10-22 09:01:27,567 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:01:27,567 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:01:27,567 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:27,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-10-22 09:01:27,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:01:27,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:27,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:27,568 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:27,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:27,569 INFO L791 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 73#L553-3 [2019-10-22 09:01:27,569 INFO L793 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2019-10-22 09:01:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 09:01:27,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825595914] [2019-10-22 09:01:27,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,597 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2019-10-22 09:01:27,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668164972] [2019-10-22 09:01:27,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,625 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2019-10-22 09:01:27,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215666167] [2019-10-22 09:01:27,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:27,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:27,833 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-10-22 09:01:28,059 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-22 09:01:28,152 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:28,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:28,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:28,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:28,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:28,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:28,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:28,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:28,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration3_Lasso [2019-10-22 09:01:28,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:28,154 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:28,185 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 09:01:28,191 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 09:01:28,196 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 09:01:28,199 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 09:01:28,203 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 09:01:28,207 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 09:01:28,215 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 09:01:28,219 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 09:01:28,222 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 09:01:28,226 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 09:01:28,228 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 09:01:28,232 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 09:01:28,234 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 09:01:28,237 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 09:01:28,438 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-22 09:01:28,525 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 09:01:28,528 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 09:01:28,532 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 09:01:28,535 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 09:01:28,537 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 09:01:28,994 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:01:29,026 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:29,037 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:29,039 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 09:01:29,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,050 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 09:01:29,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,053 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,053 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,059 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 09:01:29,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,063 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 09:01:29,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,068 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 09:01:29,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,073 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 09:01:29,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,083 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,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 09:01:29,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:29,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,102 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 09:01:29,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,110 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,110 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,119 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 09:01:29,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,122 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,125 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 09:01:29,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,128 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,134 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 09:01:29,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,137 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,138 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,141 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 09:01:29,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:29,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,143 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:29,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:29,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,144 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 09:01:29,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,182 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 09:01:29,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,186 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,186 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,195 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 09:01:29,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,198 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,207 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 09:01:29,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:29,212 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 09:01:29,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:29,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:29,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:29,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:29,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:29,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:29,231 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:29,252 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:01:29,252 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:01:29,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:29,256 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:29,256 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:29,257 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2019-10-22 09:01:29,289 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:01:29,299 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:29,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:01:29,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:29,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-10-22 09:01:29,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:29,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:29,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:01:29,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-10-22 09:01:29,481 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 09:01:29,484 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 09:01:29,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-10-22 09:01:29,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2019-10-22 09:01:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:01:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-10-22 09:01:29,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-10-22 09:01:29,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:29,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 09:01:29,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:29,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-10-22 09:01:29,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:29,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-10-22 09:01:29,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 09:01:29,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2019-10-22 09:01:29,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:01:29,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:01:29,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-10-22 09:01:29,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:29,585 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:01:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-10-22 09:01:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-10-22 09:01:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 09:01:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-10-22 09:01:29,588 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-22 09:01:29,588 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-22 09:01:29,588 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:29,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-10-22 09:01:29,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:01:29,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:29,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:29,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:01:29,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,589 INFO L791 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-10-22 09:01:29,590 INFO L793 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2019-10-22 09:01:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 09:01:29,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090452500] [2019-10-22 09:01:29,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,624 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2019-10-22 09:01:29,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594174357] [2019-10-22 09:01:29,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:29,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594174357] [2019-10-22 09:01:29,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804794741] [2019-10-22 09:01:29,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/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 09:01:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:01:29,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:29,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 09:01:29,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:29,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:29,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:29,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 09:01:29,749 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 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 09:01:29,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:29,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:29,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:29,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 09:01:29,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:29,768 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:29,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-22 09:01:29,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104377843] [2019-10-22 09:01:29,769 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:29,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:29,769 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-10-22 09:01:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,855 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2019-10-22 09:01:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:29,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2019-10-22 09:01:29,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-10-22 09:01:29,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2019-10-22 09:01:29,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 09:01:29,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 09:01:29,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2019-10-22 09:01:29,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:29,858 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-10-22 09:01:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2019-10-22 09:01:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-10-22 09:01:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 09:01:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-10-22 09:01:29,861 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-10-22 09:01:29,861 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-10-22 09:01:29,861 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:29,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-10-22 09:01:29,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:01:29,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:29,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:29,863 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:01:29,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,863 INFO L791 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-10-22 09:01:29,864 INFO L793 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2019-10-22 09:01:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-10-22 09:01:29,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133821604] [2019-10-22 09:01:29,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,888 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2019-10-22 09:01:29,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218222879] [2019-10-22 09:01:29,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,922 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2019-10-22 09:01:29,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065513314] [2019-10-22 09:01:29,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:29,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:30,160 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-10-22 09:01:30,345 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-10-22 09:01:30,433 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:30,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:30,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:30,434 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:30,434 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:30,434 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:30,434 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:30,434 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:30,434 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration5_Lasso [2019-10-22 09:01:30,434 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:30,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:30,437 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 09:01:30,439 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 09:01:30,441 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 09:01:30,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:30,445 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 09:01:30,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:30,448 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 09:01:30,451 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 09:01:30,453 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 09:01:30,455 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 09:01:30,456 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 09:01:30,460 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 09:01:30,463 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 09:01:30,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 09:01:30,466 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 09:01:30,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 09:01:30,470 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 09:01:30,472 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 09:01:30,473 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 09:01:31,025 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:31,025 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:31,026 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 09:01:31,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,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 09:01:31,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,031 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 09:01:31,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,032 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,032 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,034 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 09:01:31,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,036 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 09:01:31,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,039 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 09:01:31,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,041 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 09:01:31,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,043 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,045 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 09:01:31,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,047 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,047 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,049 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 09:01:31,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,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 09:01:31,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,053 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,053 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,054 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 09:01:31,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,056 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 09:01:31,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,060 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 09:01:31,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,062 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 09:01:31,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,064 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 09:01:31,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,067 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 09:01:31,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,068 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,070 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 09:01:31,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,072 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,072 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,074 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 09:01:31,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:31,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:31,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:31,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,076 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 09:01:31,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,079 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,091 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 09:01:31,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,093 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,093 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,097 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 09:01:31,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:31,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,106 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,106 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:31,111 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 09:01:31,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:31,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:31,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:31,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:31,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:31,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:31,123 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:31,130 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:31,130 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:01:31,130 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:31,131 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:31,131 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:31,131 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2019-10-22 09:01:31,168 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:01:31,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:31,231 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 1 case distinctions, treesize of input 19 treesize of output 42 [2019-10-22 09:01:31,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:31,254 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-10-22 09:01:31,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:31,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:23 [2019-10-22 09:01:31,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,387 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:31,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 69 [2019-10-22 09:01:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:31,419 INFO L567 ElimStorePlain]: treesize reduction 27, result has 53.4 percent of original size [2019-10-22 09:01:31,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:31,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:30 [2019-10-22 09:01:31,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,602 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-10-22 09:01:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:31,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:31,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2019-10-22 09:01:31,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:31,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:31,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 33 [2019-10-22 09:01:31,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:31,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:31,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-22 09:01:31,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:109, output treesize:77 [2019-10-22 09:01:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:31,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-10-22 09:01:31,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2019-10-22 09:01:32,036 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-10-22 09:01:32,201 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-10-22 09:01:32,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2019-10-22 09:01:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:01:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2019-10-22 09:01:32,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2019-10-22 09:01:32,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:32,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2019-10-22 09:01:32,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:32,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2019-10-22 09:01:32,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:32,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2019-10-22 09:01:32,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-10-22 09:01:32,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2019-10-22 09:01:32,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-10-22 09:01:32,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-10-22 09:01:32,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2019-10-22 09:01:32,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:32,269 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2019-10-22 09:01:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2019-10-22 09:01:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-10-22 09:01:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 09:01:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2019-10-22 09:01:32,279 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-10-22 09:01:32,279 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-10-22 09:01:32,279 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:32,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2019-10-22 09:01:32,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-10-22 09:01:32,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:32,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:32,281 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:32,281 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-10-22 09:01:32,281 INFO L791 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-10-22 09:01:32,281 INFO L793 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2019-10-22 09:01:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-10-22 09:01:32,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190541346] [2019-10-22 09:01:32,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2019-10-22 09:01:32,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371047285] [2019-10-22 09:01:32,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2019-10-22 09:01:32,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445090] [2019-10-22 09:01:32,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445090] [2019-10-22 09:01:32,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234435480] [2019-10-22 09:01:32,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:32,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:32,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 09:01:32,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:32,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:32,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:32,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 09:01:32,446 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 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 09:01:32,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:32,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:32,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:32,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 09:01:32,458 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 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-22 09:01:32,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:32,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:32,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:32,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-22 09:01:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:32,471 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:32,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-22 09:01:32,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292540779] [2019-10-22 09:01:32,725 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2019-10-22 09:01:32,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:01:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:32,757 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2019-10-22 09:01:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,871 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2019-10-22 09:01:32,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:32,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2019-10-22 09:01:32,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2019-10-22 09:01:32,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2019-10-22 09:01:32,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2019-10-22 09:01:32,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-10-22 09:01:32,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2019-10-22 09:01:32,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:32,877 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2019-10-22 09:01:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2019-10-22 09:01:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2019-10-22 09:01:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-22 09:01:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-10-22 09:01:32,886 INFO L711 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-10-22 09:01:32,886 INFO L591 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-10-22 09:01:32,886 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:32,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2019-10-22 09:01:32,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-10-22 09:01:32,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:32,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:32,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:32,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,888 INFO L791 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-10-22 09:01:32,889 INFO L793 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2019-10-22 09:01:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,889 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2019-10-22 09:01:32,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523748870] [2019-10-22 09:01:32,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,899 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2019-10-22 09:01:32,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74637636] [2019-10-22 09:01:32,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,918 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2019-10-22 09:01:32,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650784590] [2019-10-22 09:01:32,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:32,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,326 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2019-10-22 09:01:33,606 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-10-22 09:01:33,685 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:33,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:33,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:33,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:33,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:33,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:33,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:33,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:33,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration7_Lasso [2019-10-22 09:01:33,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:33,686 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:33,688 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 09:01:33,690 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 09:01:33,692 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 09:01:33,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 09:01:33,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 09:01:33,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 09:01:33,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 09:01:33,705 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 09:01:33,708 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 09:01:33,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 09:01:33,715 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 09:01:33,717 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 09:01:33,719 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 09:01:33,720 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 09:01:33,722 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 09:01:33,724 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 09:01:33,726 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 09:01:33,727 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 09:01:33,728 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 09:01:33,872 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-22 09:01:33,933 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 09:01:34,331 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:34,332 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:34,332 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 09:01:34,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,336 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 09:01:34,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:34,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,339 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,340 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,341 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 09:01:34,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,343 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,345 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 09:01:34,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,347 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 09:01:34,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,349 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,350 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 09:01:34,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,354 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 09:01:34,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,355 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,356 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,358 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 09:01:34,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,359 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,359 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,360 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 09:01:34,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,363 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,364 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,365 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 09:01:34,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,369 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 09:01:34,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,371 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 09:01:34,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,372 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,373 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 09:01:34,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,376 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 09:01:34,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,378 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 09:01:34,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:34,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,382 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,383 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,384 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 09:01:34,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:34,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,400 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:34,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:34,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,401 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 09:01:34,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,402 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,402 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:34,406 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 09:01:34,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:34,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:34,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:34,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:34,411 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:34,413 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:34,460 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:34,506 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:01:34,506 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:01:34,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:34,507 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:34,507 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:34,508 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-10-22 09:01:34,539 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:01:34,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:34,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:34,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2019-10-22 09:01:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:34,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:34,691 INFO L567 ElimStorePlain]: treesize reduction 43, result has 53.8 percent of original size [2019-10-22 09:01:34,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:34,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:49 [2019-10-22 09:01:34,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:34,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2019-10-22 09:01:34,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:34,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 41 [2019-10-22 09:01:34,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:34,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:34,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:01:34,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:125, output treesize:121 [2019-10-22 09:01:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:34,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:34,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:34,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 52 [2019-10-22 09:01:34,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:34,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 52 [2019-10-22 09:01:34,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:34,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:34,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:01:34,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:121 [2019-10-22 09:01:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:34,974 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 09:01:34,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-10-22 09:01:35,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2019-10-22 09:01:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:01:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2019-10-22 09:01:35,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2019-10-22 09:01:35,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:35,462 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,592 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2019-10-22 09:01:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,633 INFO L567 ElimStorePlain]: treesize reduction 43, result has 53.8 percent of original size [2019-10-22 09:01:35,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:49 [2019-10-22 09:01:35,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2019-10-22 09:01:35,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 41 [2019-10-22 09:01:35,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:01:35,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:125, output treesize:121 [2019-10-22 09:01:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:35,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:35,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 52 [2019-10-22 09:01:35,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 52 [2019-10-22 09:01:35,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:35,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:35,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:01:35,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:121 [2019-10-22 09:01:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:35,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-10-22 09:01:35,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2019-10-22 09:01:36,638 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 361 states and 453 transitions. Complement of second has 31 states. [2019-10-22 09:01:36,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:01:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2019-10-22 09:01:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 4 letters. Loop has 14 letters. [2019-10-22 09:01:36,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 18 letters. Loop has 14 letters. [2019-10-22 09:01:36,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:36,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 4 letters. Loop has 28 letters. [2019-10-22 09:01:36,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:36,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 453 transitions. [2019-10-22 09:01:36,644 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-10-22 09:01:36,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 290 states and 370 transitions. [2019-10-22 09:01:36,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2019-10-22 09:01:36,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-10-22 09:01:36,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 370 transitions. [2019-10-22 09:01:36,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:36,653 INFO L688 BuchiCegarLoop]: Abstraction has 290 states and 370 transitions. [2019-10-22 09:01:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 370 transitions. [2019-10-22 09:01:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 233. [2019-10-22 09:01:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-22 09:01:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2019-10-22 09:01:36,674 INFO L711 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-10-22 09:01:36,674 INFO L591 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2019-10-22 09:01:36,674 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:36,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2019-10-22 09:01:36,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-10-22 09:01:36,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:36,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:36,675 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:36,675 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:36,676 INFO L791 eck$LassoCheckResult]: Stem: 1956#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1954#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1955#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1957#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1958#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1971#L555-1 [2019-10-22 09:01:36,676 INFO L793 eck$LassoCheckResult]: Loop: 1971#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1962#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1963#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1966#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1971#L555-1 [2019-10-22 09:01:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-10-22 09:01:36,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896155166] [2019-10-22 09:01:36,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:36,700 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2019-10-22 09:01:36,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843484608] [2019-10-22 09:01:36,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:36,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2019-10-22 09:01:36,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213452439] [2019-10-22 09:01:36,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:36,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:37,131 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-10-22 09:01:37,565 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2019-10-22 09:01:37,567 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:37,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:37,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:37,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:37,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:37,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:37,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:37,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:37,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration8_Lasso [2019-10-22 09:01:37,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:37,568 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:37,575 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 09:01:37,582 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 09:01:37,585 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 09:01:37,586 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 09:01:37,588 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 09:01:37,591 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 09:01:37,596 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 09:01:37,597 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 09:01:37,600 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 09:01:37,601 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 09:01:37,968 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-22 09:01:38,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 09:01:38,043 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 09:01:38,044 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 09:01:38,045 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 09:01:38,047 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 09:01:38,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 09:01:38,576 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:38,576 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:38,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:38,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:38,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:38,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:38,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,579 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 09:01:38,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,580 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:38,580 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,581 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 09:01:38,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:38,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:38,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:38,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,584 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 09:01:38,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:38,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:38,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:38,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:38,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,587 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:38,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,588 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 09:01:38,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:38,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:38,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:38,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,590 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 09:01:38,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,591 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:38,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,591 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:38,591 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:38,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,592 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 09:01:38,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:38,593 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,595 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 09:01:38,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:38,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,597 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:38,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:38,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,597 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 09:01:38,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,598 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:01:38,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,600 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:38,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:38,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,609 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:38,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,617 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 09:01:38,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,618 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:38,618 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,619 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 09:01:38,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:38,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:38,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:38,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:38,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:38,624 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 09:01:38,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:38,625 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:01:38,625 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:38,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:38,633 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-10-22 09:01:38,633 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:01:39,005 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:39,390 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:39,390 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:01:39,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:39,392 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 09:01:39,392 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:39,392 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2019-10-22 09:01:39,429 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:01:39,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:39,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:39,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:39,501 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 0 case distinctions, treesize of input 43 treesize of output 23 [2019-10-22 09:01:39,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:39,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-10-22 09:01:39,534 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 09:01:39,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:39,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2019-10-22 09:01:39,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2019-10-22 09:01:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-10-22 09:01:39,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:01:39,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:39,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:01:39,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:39,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 09:01:39,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:39,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2019-10-22 09:01:39,586 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-10-22 09:01:39,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2019-10-22 09:01:39,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-10-22 09:01:39,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-10-22 09:01:39,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2019-10-22 09:01:39,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:39,593 INFO L688 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2019-10-22 09:01:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2019-10-22 09:01:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2019-10-22 09:01:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 09:01:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2019-10-22 09:01:39,615 INFO L711 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-10-22 09:01:39,615 INFO L591 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2019-10-22 09:01:39,615 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:39,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2019-10-22 09:01:39,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-10-22 09:01:39,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:39,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:39,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,618 INFO L791 eck$LassoCheckResult]: Stem: 2661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2659#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2660#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2842#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2807#L555-1 assume !test_fun_#t~short8; 2737#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 2732#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2686#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2687#L553-1 [2019-10-22 09:01:39,618 INFO L793 eck$LassoCheckResult]: Loop: 2687#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2735#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2725#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2663#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2707#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2693#L555-1 assume !test_fun_#t~short8; 2695#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 2679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2680#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2687#L553-1 [2019-10-22 09:01:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2019-10-22 09:01:39,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572596307] [2019-10-22 09:01:39,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:39,640 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2019-10-22 09:01:39,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757802057] [2019-10-22 09:01:39,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:39,653 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:39,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2019-10-22 09:01:39,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614515255] [2019-10-22 09:01:39,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:39,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614515255] [2019-10-22 09:01:39,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132907929] [2019-10-22 09:01:39,743 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:39,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 09:01:39,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:39,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 09:01:39,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:39,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 09:01:39,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:39,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-22 09:01:39,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 09:01:39,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:39,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-10-22 09:01:39,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:39,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 09:01:39,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:39,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-10-22 09:01:39,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-10-22 09:01:39,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:39,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:39,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-10-22 09:01:39,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:39,962 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:39,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-10-22 09:01:39,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674049278] [2019-10-22 09:01:40,164 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-10-22 09:01:40,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:01:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:40,198 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 12 states. [2019-10-22 09:01:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,322 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2019-10-22 09:01:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:01:40,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2019-10-22 09:01:40,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-10-22 09:01:40,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2019-10-22 09:01:40,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-10-22 09:01:40,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-10-22 09:01:40,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2019-10-22 09:01:40,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:40,328 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2019-10-22 09:01:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2019-10-22 09:01:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-10-22 09:01:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 09:01:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-10-22 09:01:40,337 INFO L711 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-10-22 09:01:40,337 INFO L591 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-10-22 09:01:40,337 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:01:40,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2019-10-22 09:01:40,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2019-10-22 09:01:40,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:40,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:40,339 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,339 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,339 INFO L791 eck$LassoCheckResult]: Stem: 3315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3313#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3314#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3359#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3358#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3353#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3354#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3349#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3350#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3346#L555-1 assume !test_fun_#t~short8; 3345#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3344#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3330#L553-1 [2019-10-22 09:01:40,339 INFO L793 eck$LassoCheckResult]: Loop: 3330#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3409#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3406#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3404#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3402#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3399#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3397#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3394#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3395#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3388#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3389#L555-1 assume !test_fun_#t~short8; 3340#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3341#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3329#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3330#L553-1 [2019-10-22 09:01:40,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2019-10-22 09:01:40,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109089562] [2019-10-22 09:01:40,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:40,368 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2019-10-22 09:01:40,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886658127] [2019-10-22 09:01:40,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:40,393 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2019-10-22 09:01:40,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52850156] [2019-10-22 09:01:40,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:40,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52850156] [2019-10-22 09:01:40,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043494959] [2019-10-22 09:01:40,554 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f8e4fe7-d60d-42e9-b7f6-29154b9bd29c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:40,614 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-10-22 09:01:40,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:40,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:01:40,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:40,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 09:01:40,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:40,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-22 09:01:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:40,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 63 [2019-10-22 09:01:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,706 INFO L567 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-10-22 09:01:40,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-10-22 09:01:40,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:01:40,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:40,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 [2019-10-22 09:01:40,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2019-10-22 09:01:40,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,795 INFO L567 ElimStorePlain]: treesize reduction 37, result has 43.1 percent of original size [2019-10-22 09:01:40,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:28 [2019-10-22 09:01:40,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:40,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 [2019-10-22 09:01:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,844 INFO L567 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-10-22 09:01:40,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:40,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2019-10-22 09:01:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:01:40,894 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:40,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-10-22 09:01:40,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231913167] [2019-10-22 09:01:41,119 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2019-10-22 09:01:41,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 09:01:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-22 09:01:41,151 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2019-10-22 09:01:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:41,553 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2019-10-22 09:01:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:01:41,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2019-10-22 09:01:41,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:41,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2019-10-22 09:01:41,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 09:01:41,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 09:01:41,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2019-10-22 09:01:41,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:41,558 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-10-22 09:01:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2019-10-22 09:01:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-10-22 09:01:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 09:01:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-22 09:01:41,559 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-22 09:01:41,559 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-22 09:01:41,559 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:01:41,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2019-10-22 09:01:41,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:01:41,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:41,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:41,560 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:01:41,561 INFO L791 eck$LassoCheckResult]: Stem: 3673#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3671#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3672#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3678#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3679#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3709#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3708#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3707#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3706#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3705#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3704#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3703#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3702#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3691#L555-1 assume !test_fun_#t~short8; 3689#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3688#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3687#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3680#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3681#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3685#L555-1 [2019-10-22 09:01:41,561 INFO L793 eck$LassoCheckResult]: Loop: 3685#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3674#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3675#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3682#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3685#L555-1 [2019-10-22 09:01:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2019-10-22 09:01:41,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831181978] [2019-10-22 09:01:41,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,596 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2019-10-22 09:01:41,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694813909] [2019-10-22 09:01:41,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2019-10-22 09:01:41,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961184565] [2019-10-22 09:01:41,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,649 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:41,755 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-22 09:01:43,368 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 201 DAG size of output: 153 [2019-10-22 09:01:43,481 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-22 09:01:43,483 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:43,484 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:43,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:43,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:43,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:43,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:43,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:43,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:43,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration11_Lasso [2019-10-22 09:01:43,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:43,484 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:43,487 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 09:01:43,493 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 09:01:43,496 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 09:01:43,498 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 09:01:43,500 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 09:01:43,501 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 09:01:43,502 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 09:01:43,503 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 09:01:43,504 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 09:01:43,506 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 09:01:43,508 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 09:01:43,717 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 09:01:43,719 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 09:01:43,720 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 09:01:43,721 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 09:01:43,723 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 09:01:43,724 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 09:01:43,726 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 09:01:44,147 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:44,148 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:44,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:44,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:44,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,152 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:44,152 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:44,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,153 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 09:01:44,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,154 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:44,155 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:44,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:44,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,157 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 09:01:44,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,159 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:44,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,161 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:44,161 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:44,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,163 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 09:01:44,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,164 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,164 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,164 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 09:01:44,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,167 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 09:01:44,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,168 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,168 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,168 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 09:01:44,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,170 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 09:01:44,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,171 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:01:44,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,172 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:01:44,172 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:44,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,179 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 09:01:44,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,179 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:01:44,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,187 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 09:01:44,187 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:01:44,553 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:45,033 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:45,037 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:01:45,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:45,039 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 09:01:45,039 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:45,039 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2019-10-22 09:01:45,069 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:01:45,070 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:01:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,154 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 0 case distinctions, treesize of input 43 treesize of output 23 [2019-10-22 09:01:45,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:45,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 [2019-10-22 09:01:45,179 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 09:01:45,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:45,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 09:01:45,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2019-10-22 09:01:45,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-10-22 09:01:45,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:01:45,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,209 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,290 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 0 case distinctions, treesize of input 43 treesize of output 23 [2019-10-22 09:01:45,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:45,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:44 [2019-10-22 09:01:45,319 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 09:01:45,319 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:45,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 09:01:45,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2019-10-22 09:01:45,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-10-22 09:01:45,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:01:45,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,368 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:01:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:45,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:01:45,450 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 0 case distinctions, treesize of input 43 treesize of output 23 [2019-10-22 09:01:45,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:45,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:45,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-10-22 09:01:45,473 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 09:01:45,473 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:01:45,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 09:01:45,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2019-10-22 09:01:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 09:01:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:01:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-10-22 09:01:45,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:01:45,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2019-10-22 09:01:45,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2019-10-22 09:01:45,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:45,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2019-10-22 09:01:45,507 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:45,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-10-22 09:01:45,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:01:45,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:01:45,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:01:45,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:45,508 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:45,508 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:45,508 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:45,508 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:01:45,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:45,508 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:01:45,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:01:45,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:45 BoogieIcfgContainer [2019-10-22 09:01:45,515 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:45,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:45,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:45,516 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:45,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:27" (3/4) ... [2019-10-22 09:01:45,519 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:45,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:45,521 INFO L168 Benchmark]: Toolchain (without parser) took 19476.31 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.7 MB). Free memory was 945.9 MB in the beginning and 1.4 GB in the end (delta: -455.0 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:45,524 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:45,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:45,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:45,524 INFO L168 Benchmark]: Boogie Preprocessor took 34.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:45,525 INFO L168 Benchmark]: RCFGBuilder took 262.48 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.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:45,525 INFO L168 Benchmark]: BuchiAutomizer took 18509.63 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -308.2 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:45,525 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:45,526 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.48 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.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18509.63 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -308.2 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 16 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.4s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 13.2s. Construction of modules took 0.8s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 210 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 186 SDslu, 85 SDs, 0 SdLazy, 814 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax105 hnf99 lsp83 ukn57 mio100 lsp33 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf211 smp79 tf100 neg95 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 767ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 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...