./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/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 32bit --witnessprinter.graph.data.programhash e74ff11a050ce92aa6d5151e04de4f3f3a890d4c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:10:16,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:10:16,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:10:16,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:10:16,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:10:16,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:10:16,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:10:16,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:10:16,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:10:16,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:10:16,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:10:16,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:10:16,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:10:16,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:10:16,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:10:16,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:10:16,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:10:16,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:10:16,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:10:16,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:10:16,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:10:16,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:10:16,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:10:16,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:10:16,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:10:16,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:10:16,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:10:16,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:10:16,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:10:16,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:10:16,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:10:16,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:10:16,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:10:16,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:10:16,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:10:16,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:10:16,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 05:10:16,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:10:16,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:10:16,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:10:16,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:10:16,897 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:10:16,897 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:10:16,897 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:10:16,897 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:10:16,898 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:10:16,898 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:10:16,898 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:10:16,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:10:16,898 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:10:16,898 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:10:16,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:10:16,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:10:16,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:10:16,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:10:16,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:10:16,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:10:16,899 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:10:16,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:10:16,900 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:10:16,900 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:10:16,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:10:16,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:10:16,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:10:16,900 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:10:16,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:10:16,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:10:16,901 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:10:16,902 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:10:16,902 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e74ff11a050ce92aa6d5151e04de4f3f3a890d4c [2018-11-23 05:10:16,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:10:16,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:10:16,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:10:16,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:10:16,939 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:10:16,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-23 05:10:16,985 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/data/1dcc0573f/ef340b63a0c04c18a347567e87ecd0bd/FLAGd2d6aee08 [2018-11-23 05:10:17,314 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:10:17,314 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-23 05:10:17,318 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/data/1dcc0573f/ef340b63a0c04c18a347567e87ecd0bd/FLAGd2d6aee08 [2018-11-23 05:10:17,741 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/uautomizer/data/1dcc0573f/ef340b63a0c04c18a347567e87ecd0bd [2018-11-23 05:10:17,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:10:17,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:10:17,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:10:17,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:10:17,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:10:17,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbfdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17, skipping insertion in model container [2018-11-23 05:10:17,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:10:17,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:10:17,877 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:10:17,880 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:10:17,894 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:10:17,906 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:10:17,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17 WrapperNode [2018-11-23 05:10:17,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:10:17,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:10:17,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:10:17,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:10:17,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:10:17,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:10:17,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:10:17,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:10:17,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... [2018-11-23 05:10:17,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:10:17,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:10:17,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:10:17,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:10:17,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a6db842-ad7c-434a-9a64-a2f2bdd1549f/bin-2019/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 [2018-11-23 05:10:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:10:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:10:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:10:18,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:10:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:10:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:10:18,137 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:10:18,137 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 05:10:18,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:10:18 BoogieIcfgContainer [2018-11-23 05:10:18,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:10:18,138 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:10:18,138 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:10:18,140 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:10:18,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:10:18,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:10:17" (1/3) ... [2018-11-23 05:10:18,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e4d573c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:10:18, skipping insertion in model container [2018-11-23 05:10:18,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:10:18,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:10:17" (2/3) ... [2018-11-23 05:10:18,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e4d573c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:10:18, skipping insertion in model container [2018-11-23 05:10:18,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:10:18,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:10:18" (3/3) ... [2018-11-23 05:10:18,143 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-23 05:10:18,183 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:10:18,184 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:10:18,184 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:10:18,184 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:10:18,184 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:10:18,184 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:10:18,184 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:10:18,184 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:10:18,184 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:10:18,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 05:10:18,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 05:10:18,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:18,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:18,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 05:10:18,219 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:10:18,219 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:10:18,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 05:10:18,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-23 05:10:18,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:18,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:18,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 05:10:18,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:10:18,225 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 11#L14-3true [2018-11-23 05:10:18,225 INFO L796 eck$LassoCheckResult]: Loop: 11#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 13#L17-5true assume !true; 12#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 14#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-3true [2018-11-23 05:10:18,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 05:10:18,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:18,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2018-11-23 05:10:18,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:18,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:10:18,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:10:18,337 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 05:10:18,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:10:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:10:18,348 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 05:10:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:10:18,352 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 05:10:18,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:10:18,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-23 05:10:18,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 05:10:18,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2018-11-23 05:10:18,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 05:10:18,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:10:18,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-23 05:10:18,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:10:18,359 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:10:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-23 05:10:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:10:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:10:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 05:10:18,382 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:10:18,382 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:10:18,382 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:10:18,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-23 05:10:18,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 05:10:18,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:18,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:18,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 05:10:18,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 05:10:18,384 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 48#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 49#L14-3 [2018-11-23 05:10:18,384 INFO L796 eck$LassoCheckResult]: Loop: 49#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 55#L17-5 main_#t~short4 := main_~i~0 >= 0; 44#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 45#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 53#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 54#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 49#L14-3 [2018-11-23 05:10:18,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:18,384 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 05:10:18,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:18,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:18,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2018-11-23 05:10:18,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:18,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:18,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:18,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2018-11-23 05:10:18,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:18,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:18,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:18,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:18,603 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-23 05:10:18,736 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:10:18,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:10:18,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:10:18,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:10:18,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:10:18,737 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:10:18,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:10:18,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:10:18,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-23 05:10:18,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:10:18,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:10:18,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:18,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:10:19,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:10:19,151 INFO L122 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 [2018-11-23 05:10:19,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,156 INFO L122 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 [2018-11-23 05:10:19,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,159 INFO L122 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 [2018-11-23 05:10:19,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,161 INFO L122 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 [2018-11-23 05:10:19,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,163 INFO L122 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 [2018-11-23 05:10:19,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,165 INFO L122 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 [2018-11-23 05:10:19,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,167 INFO L122 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 [2018-11-23 05:10:19,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:19,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:19,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,173 INFO L122 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 [2018-11-23 05:10:19,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,176 INFO L122 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 [2018-11-23 05:10:19,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,178 INFO L122 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 [2018-11-23 05:10:19,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,180 INFO L122 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 [2018-11-23 05:10:19,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,183 INFO L122 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 [2018-11-23 05:10:19,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:19,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:19,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,189 INFO L122 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 [2018-11-23 05:10:19,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,191 INFO L122 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 [2018-11-23 05:10:19,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,194 INFO L122 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 [2018-11-23 05:10:19,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,195 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:10:19,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,199 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:10:19,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:19,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:10:19,272 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:10:19,272 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:10:19,274 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:10:19,276 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:10:19,276 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:10:19,276 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 05:10:19,306 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 05:10:19,313 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:10:19,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:19,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:19,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:19,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:10:19,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 05:10:19,443 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2018-11-23 05:10:19,444 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 [2018-11-23 05:10:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:10:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 05:10:19,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 05:10:19,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:19,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-23 05:10:19,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:19,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-23 05:10:19,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:19,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-11-23 05:10:19,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:10:19,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2018-11-23 05:10:19,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 05:10:19,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 05:10:19,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 05:10:19,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:19,452 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 05:10:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 05:10:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 05:10:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:10:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-11-23 05:10:19,453 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 05:10:19,453 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-23 05:10:19,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:10:19,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-11-23 05:10:19,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:10:19,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:19,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:19,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:10:19,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:10:19,454 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 144#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 151#L17-5 [2018-11-23 05:10:19,454 INFO L796 eck$LassoCheckResult]: Loop: 151#L17-5 main_#t~short4 := main_~i~0 >= 0; 137#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 138#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 151#L17-5 [2018-11-23 05:10:19,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-11-23 05:10:19,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:19,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:19,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:19,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:19,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:19,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2018-11-23 05:10:19,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:19,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:19,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:19,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:19,480 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2018-11-23 05:10:19,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:19,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:19,698 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:10:19,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:10:19,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:10:19,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:10:19,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:10:19,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:10:19,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:10:19,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:10:19,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-23 05:10:19,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:10:19,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:10:19,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:19,897 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:10:19,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:10:19,897 INFO L122 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 [2018-11-23 05:10:19,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,899 INFO L122 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 [2018-11-23 05:10:19,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,902 INFO L122 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 [2018-11-23 05:10:19,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,904 INFO L122 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 [2018-11-23 05:10:19,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:19,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:19,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:19,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,907 INFO L122 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 [2018-11-23 05:10:19,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:19,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:19,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,915 INFO L122 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 [2018-11-23 05:10:19,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:19,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:19,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:19,923 INFO L122 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 [2018-11-23 05:10:19,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:19,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:19,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:19,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:19,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:19,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:19,938 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:10:19,948 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:10:19,948 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:10:19,949 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:10:19,949 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:10:19,950 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:10:19,950 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-23 05:10:19,972 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 05:10:19,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:19,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:19,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:20,040 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 [2018-11-23 05:10:20,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-23 05:10:20,070 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 69 states and 87 transitions. Complement of second has 9 states. [2018-11-23 05:10:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 05:10:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:10:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-23 05:10:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 05:10:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 05:10:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 05:10:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:20,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2018-11-23 05:10:20,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2018-11-23 05:10:20,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 58 transitions. [2018-11-23 05:10:20,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 05:10:20,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 05:10:20,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2018-11-23 05:10:20,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:20,076 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2018-11-23 05:10:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2018-11-23 05:10:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-11-23 05:10:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:10:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-23 05:10:20,079 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 05:10:20,079 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 05:10:20,079 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:10:20,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-23 05:10:20,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:10:20,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:20,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:20,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 05:10:20,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:10:20,080 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 284#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 285#L14-4 main_~k~0 := 1; 281#L23-3 [2018-11-23 05:10:20,081 INFO L796 eck$LassoCheckResult]: Loop: 281#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 282#L4 assume !(0 == __VERIFIER_assert_~cond); 295#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 286#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 281#L23-3 [2018-11-23 05:10:20,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,082 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2018-11-23 05:10:20,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:20,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2018-11-23 05:10:20,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2018-11-23 05:10:20,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:20,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:10:20,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:10:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:10:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:10:20,325 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-23 05:10:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:10:20,383 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-11-23 05:10:20,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:10:20,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2018-11-23 05:10:20,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:10:20,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2018-11-23 05:10:20,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 05:10:20,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 05:10:20,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-11-23 05:10:20,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:20,385 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 05:10:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-11-23 05:10:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-23 05:10:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:10:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-23 05:10:20,387 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 05:10:20,387 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-23 05:10:20,387 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:10:20,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-23 05:10:20,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:10:20,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:20,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:20,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:10:20,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:10:20,390 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 342#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 343#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 349#L17-5 main_#t~short4 := main_~i~0 >= 0; 338#L17-1 assume !main_#t~short4; 339#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 347#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 348#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 350#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 352#L17-5 [2018-11-23 05:10:20,390 INFO L796 eck$LassoCheckResult]: Loop: 352#L17-5 main_#t~short4 := main_~i~0 >= 0; 336#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 337#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 352#L17-5 [2018-11-23 05:10:20,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2018-11-23 05:10:20,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:20,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:10:20,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:10:20,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:10:20,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2018-11-23 05:10:20,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:10:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:10:20,461 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-23 05:10:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:10:20,500 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 05:10:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:10:20,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-23 05:10:20,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-23 05:10:20,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 05:10:20,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 05:10:20,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 05:10:20,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2018-11-23 05:10:20,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:20,502 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-23 05:10:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2018-11-23 05:10:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-11-23 05:10:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 05:10:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-11-23 05:10:20,504 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-23 05:10:20,504 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-23 05:10:20,504 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:10:20,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-11-23 05:10:20,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-23 05:10:20,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:20,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:20,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:10:20,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:10:20,505 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 418#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 424#L17-5 main_#t~short4 := main_~i~0 >= 0; 413#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 414#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 422#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 419#L14-4 main_~k~0 := 1; 415#L23-3 [2018-11-23 05:10:20,505 INFO L796 eck$LassoCheckResult]: Loop: 415#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 416#L4 assume !(0 == __VERIFIER_assert_~cond); 429#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 420#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L23-3 [2018-11-23 05:10:20,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2018-11-23 05:10:20,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2018-11-23 05:10:20,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:20,528 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2018-11-23 05:10:20,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:20,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:20,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:20,728 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2018-11-23 05:10:20,795 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:10:20,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:10:20,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:10:20,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:10:20,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:10:20,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:10:20,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:10:20,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:10:20,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-23 05:10:20,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:10:20,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:10:20,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:20,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:10:21,096 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:10:21,096 INFO L122 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 [2018-11-23 05:10:21,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,098 INFO L122 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 [2018-11-23 05:10:21,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,099 INFO L122 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 [2018-11-23 05:10:21,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,101 INFO L122 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 [2018-11-23 05:10:21,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,102 INFO L122 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 [2018-11-23 05:10:21,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:21,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:21,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,105 INFO L122 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 [2018-11-23 05:10:21,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,107 INFO L122 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 [2018-11-23 05:10:21,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,108 INFO L122 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 [2018-11-23 05:10:21,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,110 INFO L122 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 [2018-11-23 05:10:21,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,112 INFO L122 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 [2018-11-23 05:10:21,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:21,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:21,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:21,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:21,114 INFO L122 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 [2018-11-23 05:10:21,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:21,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:21,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:21,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:21,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:21,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:21,135 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:10:21,148 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:10:21,149 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:10:21,150 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:10:21,151 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:10:21,151 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:10:21,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2018-11-23 05:10:21,174 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 05:10:21,176 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:10:21,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:21,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:21,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:21,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:10:21,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 05:10:21,224 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 33 states and 43 transitions. Complement of second has 4 states. [2018-11-23 05:10:21,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:10:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:10:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 05:10:21,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 05:10:21,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:21,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 05:10:21,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:21,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 05:10:21,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:21,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-23 05:10:21,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:10:21,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2018-11-23 05:10:21,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 05:10:21,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 05:10:21,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-11-23 05:10:21,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:21,228 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 05:10:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-11-23 05:10:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 05:10:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:10:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-23 05:10:21,230 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 05:10:21,230 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-23 05:10:21,230 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 05:10:21,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-23 05:10:21,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:10:21,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:21,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:21,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 05:10:21,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:10:21,231 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 555#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 556#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 562#L17-5 main_#t~short4 := main_~i~0 >= 0; 576#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 572#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 566#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 567#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 563#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 564#L17-5 main_#t~short4 := main_~i~0 >= 0; 558#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 559#L17-3 [2018-11-23 05:10:21,231 INFO L796 eck$LassoCheckResult]: Loop: 559#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5;main_~i~0 := main_~i~0 - 1; 568#L17-5 main_#t~short4 := main_~i~0 >= 0; 571#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 559#L17-3 [2018-11-23 05:10:21,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2018-11-23 05:10:21,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:21,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:21,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:21,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:21,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:21,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2018-11-23 05:10:21,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:21,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:21,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2018-11-23 05:10:21,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:21,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:21,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:21,639 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 92 [2018-11-23 05:10:21,822 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-11-23 05:10:21,823 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:10:21,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:10:21,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:10:21,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:10:21,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:10:21,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:10:21,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:10:21,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:10:21,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 05:10:21,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:10:21,824 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:10:21,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:21,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:22,001 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-23 05:10:22,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:22,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:10:22,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:10:22,302 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:10:22,302 INFO L122 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 [2018-11-23 05:10:22,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,304 INFO L122 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 [2018-11-23 05:10:22,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,306 INFO L122 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 [2018-11-23 05:10:22,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,307 INFO L122 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 [2018-11-23 05:10:22,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:22,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:22,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,310 INFO L122 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 [2018-11-23 05:10:22,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,311 INFO L122 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 [2018-11-23 05:10:22,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,313 INFO L122 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 [2018-11-23 05:10:22,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,315 INFO L122 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 [2018-11-23 05:10:22,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:22,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:22,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,317 INFO L122 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 [2018-11-23 05:10:22,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:10:22,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:10:22,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:10:22,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,319 INFO L122 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 [2018-11-23 05:10:22,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,319 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:10:22,319 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 05:10:22,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,327 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 05:10:22,327 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:10:22,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,342 INFO L122 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 [2018-11-23 05:10:22,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:22,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:22,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:10:22,345 INFO L122 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 [2018-11-23 05:10:22,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:10:22,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:10:22,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:10:22,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:10:22,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:10:22,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:10:22,353 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:10:22,362 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 05:10:22,362 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 05:10:22,362 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:10:22,363 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:10:22,363 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:10:22,363 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 05:10:22,387 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 05:10:22,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:22,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:22,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:22,444 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 [2018-11-23 05:10:22,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:10:22,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-11-23 05:10:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 05:10:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:10:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-23 05:10:22,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 05:10:22,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:22,484 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:10:22,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:22,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:22,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:22,518 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 05:10:22,519 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:10:22,541 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 9 states. [2018-11-23 05:10:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 05:10:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:10:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-23 05:10:22,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 05:10:22,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:22,543 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:10:22,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:22,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:22,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:22,577 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 05:10:22,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 05:10:22,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 107 transitions. Complement of second has 10 states. [2018-11-23 05:10:22,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 05:10:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 05:10:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 05:10:22,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 05:10:22,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:22,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 05:10:22,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:22,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 05:10:22,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:10:22,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2018-11-23 05:10:22,612 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:10:22,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-11-23 05:10:22,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:10:22,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:10:22,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:10:22,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:10:22,613 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:10:22,613 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:10:22,613 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:10:22,613 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 05:10:22,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:10:22,613 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:10:22,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:10:22,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:10:22 BoogieIcfgContainer [2018-11-23 05:10:22,618 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:10:22,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:10:22,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:10:22,618 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:10:22,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:10:18" (3/4) ... [2018-11-23 05:10:22,621 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:10:22,621 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:10:22,622 INFO L168 Benchmark]: Toolchain (without parser) took 4877.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 188.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:10:22,623 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:10:22,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.83 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:10:22,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.50 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:10:22,624 INFO L168 Benchmark]: Boogie Preprocessor took 17.74 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 943.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:10:22,625 INFO L168 Benchmark]: RCFGBuilder took 189.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:10:22,625 INFO L168 Benchmark]: BuchiAutomizer took 4480.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:10:22,626 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:10:22,629 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.83 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.50 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.74 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 943.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.7 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4480.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 159 SDslu, 84 SDs, 0 SdLazy, 165 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax100 hnf99 lsp85 ukn75 mio100 lsp67 div213 bol100 ite100 ukn100 eq147 hnf59 smp88 dnf147 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 7 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...