./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-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/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/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 72925b65ef321f719f00e79529e35268c3f3eaa3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:09:53,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:09:53,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:09:53,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:09:53,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:09:53,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:09:53,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:09:53,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:09:53,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:09:53,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:09:53,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:09:53,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:09:53,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:09:53,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:09:53,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:09:53,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:09:53,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:09:53,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:09:53,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:09:53,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:09:53,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:09:53,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:09:53,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:09:53,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:09:53,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:09:53,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:09:53,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:09:53,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:09:53,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:09:53,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:09:53,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:09:53,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:09:53,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:09:53,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:09:53,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:09:53,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:09:53,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:09:53,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:09:53,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:09:53,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:09:53,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:09:53,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:09:53,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:09:53,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:09:53,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:09:53,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:09:53,941 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:09:53,941 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:09:53,941 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:09:53,942 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:09:53,942 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:09:53,942 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:09:53,942 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:09:53,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:09:53,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:09:53,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:09:53,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:09:53,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:09:53,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:09:53,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:09:53,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:09:53,944 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:09:53,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:09:53,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:09:53,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:09:53,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:09:53,945 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:09:53,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:09:53,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:09:53,946 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:09:53,947 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:09:53,947 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2019-11-15 23:09:53,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:09:54,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:09:54,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:09:54,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:09:54,031 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:09:54,031 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2019-11-15 23:09:54,096 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/data/541e6bc1c/b5f086a6ee904e4a8b804ea293e11323/FLAGba45ec887 [2019-11-15 23:09:54,566 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:09:54,567 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i [2019-11-15 23:09:54,581 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/data/541e6bc1c/b5f086a6ee904e4a8b804ea293e11323/FLAGba45ec887 [2019-11-15 23:09:54,858 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/data/541e6bc1c/b5f086a6ee904e4a8b804ea293e11323 [2019-11-15 23:09:54,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:09:54,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:09:54,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:09:54,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:09:54,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:09:54,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:09:54" (1/1) ... [2019-11-15 23:09:54,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1833de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:54, skipping insertion in model container [2019-11-15 23:09:54,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:09:54" (1/1) ... [2019-11-15 23:09:54,882 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:09:54,946 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:09:55,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:09:55,453 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:09:55,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:09:55,567 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:09:55,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55 WrapperNode [2019-11-15 23:09:55,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:09:55,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:09:55,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:09:55,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:09:55,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:09:55,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:09:55,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:09:55,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:09:55,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... [2019-11-15 23:09:55,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:09:55,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:09:55,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:09:55,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:09:55,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:09:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:09:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:09:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:09:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:09:55,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:09:55,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:09:56,084 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:09:56,085 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:09:56,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:09:56 BoogieIcfgContainer [2019-11-15 23:09:56,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:09:56,087 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:09:56,087 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:09:56,091 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:09:56,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:09:56,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:09:54" (1/3) ... [2019-11-15 23:09:56,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a51366f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:09:56, skipping insertion in model container [2019-11-15 23:09:56,095 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:09:56,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:55" (2/3) ... [2019-11-15 23:09:56,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a51366f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:09:56, skipping insertion in model container [2019-11-15 23:09:56,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:09:56,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:09:56" (3/3) ... [2019-11-15 23:09:56,098 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.13-alloca.i [2019-11-15 23:09:56,143 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:09:56,144 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:09:56,144 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:09:56,144 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:09:56,144 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:09:56,145 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:09:56,145 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:09:56,145 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:09:56,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:09:56,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:09:56,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:09:56,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:09:56,189 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:09:56,189 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:09:56,190 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:09:56,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:09:56,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:09:56,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:09:56,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:09:56,192 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:09:56,192 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:09:56,199 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2019-11-15 23:09:56,199 INFO L793 eck$LassoCheckResult]: Loop: 14#L561-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2019-11-15 23:09:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:09:56,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:56,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286283018] [2019-11-15 23:09:56,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:56,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:56,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:09:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:09:56,437 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:09:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-11-15 23:09:56,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:56,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037249128] [2019-11-15 23:09:56,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:56,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:56,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:09:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:09:56,473 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:09:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-11-15 23:09:56,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:56,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44826002] [2019-11-15 23:09:56,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:56,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:56,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:09:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:09:56,588 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:09:56,778 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-15 23:09:57,738 WARN L191 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-11-15 23:09:58,170 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-15 23:09:58,190 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:09:58,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:09:58,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:09:58,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:09:58,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:09:58,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:09:58,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:09:58,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:09:58,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration1_Lasso [2019-11-15 23:09:58,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:09:58,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:09:58,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:58,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:59,264 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-11-15 23:09:59,434 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-15 23:09:59,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:59,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-11-15 23:09:59,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-11-15 23:09:59,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-11-15 23:09:59,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:09:59,720 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 23:10:01,253 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 23:10:01,364 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:10:01,372 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:10:01,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,387 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,389 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,407 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,413 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,424 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,424 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,431 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,431 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,445 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,445 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,459 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,460 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,482 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,483 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,484 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,505 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,505 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,513 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,514 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,514 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,516 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,517 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,518 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,520 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,521 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,521 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,523 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:10:01,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:10:01,524 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:10:01,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,529 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,538 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,554 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,554 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,568 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,568 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,577 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,584 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,585 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,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-11-15 23:10:01,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,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-11-15 23:10:01,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,599 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,599 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,609 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,610 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,641 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,641 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,714 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-15 23:10:01,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,732 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-15 23:10:01,732 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:01,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:01,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:01,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:01,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:01,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:01,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:01,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:01,863 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:10:01,889 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:10:01,889 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:10:01,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:10:01,894 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:10:01,895 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:10:01,896 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2019-11-15 23:10:02,074 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-11-15 23:10:02,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:10:02,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:10:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:02,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:10:02,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:02,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:10:02,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:02,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:02,274 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-11-15 23:10:02,275 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-11-15 23:10:02,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2019-11-15 23:10:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:10:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:10:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-11-15 23:10:02,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:10:02,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:10:02,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:10:02,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:10:02,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 23:10:02,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:10:02,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-11-15 23:10:02,408 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:10:02,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2019-11-15 23:10:02,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:10:02,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:10:02,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2019-11-15 23:10:02,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:10:02,416 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-11-15 23:10:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2019-11-15 23:10:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-15 23:10:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 23:10:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-11-15 23:10:02,446 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-11-15 23:10:02,446 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-11-15 23:10:02,446 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:10:02,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2019-11-15 23:10:02,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-15 23:10:02,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:02,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:02,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:10:02,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:10:02,449 INFO L791 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 283#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2019-11-15 23:10:02,449 INFO L793 eck$LassoCheckResult]: Loop: 302#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 299#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 300#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 296#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 302#L557-1 [2019-11-15 23:10:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 23:10:02,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:02,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414571578] [2019-11-15 23:10:02,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:02,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:02,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:02,506 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2019-11-15 23:10:02,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:02,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374264117] [2019-11-15 23:10:02,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:02,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:02,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:02,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2019-11-15 23:10:02,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:02,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880563906] [2019-11-15 23:10:02,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:02,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:02,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880563906] [2019-11-15 23:10:02,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:10:02,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:10:02,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630987440] [2019-11-15 23:10:02,847 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-15 23:10:03,135 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-15 23:10:03,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:10:03,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:10:03,139 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-15 23:10:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:03,220 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2019-11-15 23:10:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:10:03,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2019-11-15 23:10:03,224 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-11-15 23:10:03,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2019-11-15 23:10:03,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 23:10:03,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 23:10:03,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2019-11-15 23:10:03,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:10:03,227 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-15 23:10:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2019-11-15 23:10:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2019-11-15 23:10:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:10:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-15 23:10:03,231 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:10:03,231 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:10:03,231 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:10:03,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-15 23:10:03,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 23:10:03,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:03,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:03,233 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:10:03,233 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:10:03,233 INFO L791 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 369#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 370#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2019-11-15 23:10:03,234 INFO L793 eck$LassoCheckResult]: Loop: 377#L557-1 assume test_fun_#t~short10; 378#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 371#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 372#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 382#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 377#L557-1 [2019-11-15 23:10:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,234 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-15 23:10:03,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579218060] [2019-11-15 23:10:03,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,277 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2019-11-15 23:10:03,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559240354] [2019-11-15 23:10:03,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2019-11-15 23:10:03,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599421320] [2019-11-15 23:10:03,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:03,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599421320] [2019-11-15 23:10:03,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:10:03,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:10:03,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351133866] [2019-11-15 23:10:03,510 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-15 23:10:03,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:10:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:10:03,557 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-15 23:10:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:03,605 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-11-15 23:10:03,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:10:03,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-11-15 23:10:03,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:10:03,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2019-11-15 23:10:03,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:10:03,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:10:03,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-15 23:10:03,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:10:03,608 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 23:10:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-15 23:10:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 23:10:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:10:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-15 23:10:03,610 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 23:10:03,610 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 23:10:03,610 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:10:03,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-15 23:10:03,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:10:03,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:03,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:03,611 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:10:03,611 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:10:03,612 INFO L791 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 418#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 419#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2019-11-15 23:10:03,612 INFO L793 eck$LassoCheckResult]: Loop: 425#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 426#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 431#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 429#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 430#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 425#L557-1 [2019-11-15 23:10:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-11-15 23:10:03,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771307041] [2019-11-15 23:10:03,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,644 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2019-11-15 23:10:03,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468943584] [2019-11-15 23:10:03,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:03,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468943584] [2019-11-15 23:10:03,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:10:03,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:10:03,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153444368] [2019-11-15 23:10:03,715 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:10:03,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:10:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:10:03,716 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-11-15 23:10:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:03,770 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-15 23:10:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:10:03,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-15 23:10:03,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:10:03,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 23:10:03,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:10:03,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:10:03,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-11-15 23:10:03,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:10:03,773 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 23:10:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-11-15 23:10:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 23:10:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:10:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 23:10:03,775 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 23:10:03,775 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 23:10:03,775 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:10:03,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-15 23:10:03,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:10:03,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:03,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:03,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:10:03,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:10:03,777 INFO L791 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 459#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 460#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 466#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2019-11-15 23:10:03,777 INFO L793 eck$LassoCheckResult]: Loop: 467#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 470#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 462#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 472#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 467#L557-3 [2019-11-15 23:10:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-15 23:10:03,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513753280] [2019-11-15 23:10:03,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,837 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2019-11-15 23:10:03,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78701443] [2019-11-15 23:10:03,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,875 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2019-11-15 23:10:03,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:03,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161348424] [2019-11-15 23:10:03,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:03,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:03,947 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:04,231 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-15 23:10:04,545 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-15 23:10:05,375 WARN L191 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 135 [2019-11-15 23:10:06,367 WARN L191 SmtUtils]: Spent 975.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 23:10:06,377 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:10:06,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:10:06,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:10:06,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:10:06,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:10:06,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:10:06,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:10:06,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:10:06,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca.i_Iteration5_Lasso [2019-11-15 23:10:06,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:10:06,378 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:10:06,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:06,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:07,985 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2019-11-15 23:10:08,275 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-11-15 23:10:08,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:10:08,474 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-15 23:10:08,667 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-11-15 23:10:09,413 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 23:10:09,622 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-15 23:10:10,630 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 23:10:10,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:10:10,728 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:10:10,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:10,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:10,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,731 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:10,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:10,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:10,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:10,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:10,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,736 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:10,736 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:10,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:10,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:10,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:10,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,740 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:10,741 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:10,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:10,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:10,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:10,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,749 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:10,749 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:10,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:10,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:10,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:10,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,768 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:10,768 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:10,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:10,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:10:10,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:10:10,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,772 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:10:10,772 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:10:10,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:10:10,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:10:10,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:10:10,776 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:10:10,776 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:10:10,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:10:10,790 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 23:10:10,790 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:10:10,984 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:10:11,099 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:10:11,099 INFO L444 ModelExtractionUtils]: 87 out of 91 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:10:11,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:10:11,101 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 23:10:11,101 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:10:11,102 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)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2019-11-15 23:10:11,316 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-15 23:10:11,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:10:11,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:10:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:11,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:10:11,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:11,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:10:11,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:11,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:11,479 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 44 treesize of output 65 [2019-11-15 23:10:11,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:11,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:11,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:11,515 INFO L567 ElimStorePlain]: treesize reduction 54, result has 39.3 percent of original size [2019-11-15 23:10:11,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:11,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-11-15 23:10:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:11,551 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-11-15 23:10:11,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 23:10:11,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2019-11-15 23:10:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:10:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:10:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 23:10:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2019-11-15 23:10:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:10:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2019-11-15 23:10:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:10:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2019-11-15 23:10:11,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:10:11,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-15 23:10:11,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:10:11,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2019-11-15 23:10:11,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:10:11,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 23:10:11,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-15 23:10:11,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:10:11,594 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-15 23:10:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-15 23:10:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-15 23:10:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:10:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-15 23:10:11,596 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 23:10:11,596 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 23:10:11,596 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:10:11,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-11-15 23:10:11,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:10:11,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:10:11,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:10:11,598 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:10:11,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:10:11,598 INFO L791 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;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 test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 734#L557-1 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 737#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 735#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 732#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 733#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 727#L557-1 assume test_fun_#t~short10; 728#L557-3 [2019-11-15 23:10:11,598 INFO L793 eck$LassoCheckResult]: Loop: 728#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 722#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 723#L561-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 741#L557-1 assume test_fun_#t~short10; 728#L557-3 [2019-11-15 23:10:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2019-11-15 23:10:11,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:11,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46277651] [2019-11-15 23:10:11,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:11,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:11,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:11,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46277651] [2019-11-15 23:10:11,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543848203] [2019-11-15 23:10:11,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5030f548-1aeb-41e7-a6ef-0b61f40dc3f2/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-11-15 23:10:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:11,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:10:11,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:11,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:11,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-15 23:10:11,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:11,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:11,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:11,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2019-11-15 23:10:11,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:11,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-15 23:10:11,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:11,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:11,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:11,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2019-11-15 23:10:11,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:10:11,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:10:11,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 23:10:11,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638365637] [2019-11-15 23:10:11,941 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:10:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2019-11-15 23:10:11,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:11,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756542967] [2019-11-15 23:10:11,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:11,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:11,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:10:11,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:10:12,065 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-15 23:10:12,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:10:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:10:12,089 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-11-15 23:10:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:12,142 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-15 23:10:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:10:12,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-15 23:10:12,143 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:10:12,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-11-15 23:10:12,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:10:12,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:10:12,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:10:12,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:10:12,143 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:10:12,144 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:10:12,144 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:10:12,144 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:10:12,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:10:12,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:10:12,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:10:12,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:10:12 BoogieIcfgContainer [2019-11-15 23:10:12,150 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:10:12,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:10:12,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:10:12,150 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:10:12,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:09:56" (3/4) ... [2019-11-15 23:10:12,154 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:10:12,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:10:12,156 INFO L168 Benchmark]: Toolchain (without parser) took 17293.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 935.7 MB in the beginning and 872.2 MB in the end (delta: 63.5 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:10:12,156 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:10:12,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:10:12,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:10:12,158 INFO L168 Benchmark]: Boogie Preprocessor took 27.64 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:10:12,158 INFO L168 Benchmark]: RCFGBuilder took 428.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:10:12,159 INFO L168 Benchmark]: BuchiAutomizer took 16062.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 872.2 MB in the end (delta: 207.4 MB). Peak memory consumption was 356.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:10:12,159 INFO L168 Benchmark]: Witness Printer took 3.65 ms. Allocated memory is still 1.3 GB. Free memory is still 872.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:10:12,162 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.64 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 428.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16062.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 872.2 MB in the end (delta: 207.4 MB). Peak memory consumption was 356.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.65 ms. Allocated memory is still 1.3 GB. Free memory is still 872.2 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 15.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 64 SDslu, 37 SDs, 0 SdLazy, 138 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital648 mio100 ax103 hnf99 lsp73 ukn74 mio100 lsp28 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf621 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 117ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...