./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 03:39:49,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:39:49,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:39:49,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:39:49,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:39:49,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:39:49,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:39:49,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:39:49,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:39:49,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:39:49,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:39:49,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:39:49,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:39:49,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:39:49,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:39:49,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:39:49,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:39:49,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:39:49,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:39:49,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:39:49,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:39:49,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:39:49,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:39:49,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:39:49,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:39:49,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:39:49,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:39:49,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:39:49,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:39:49,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:39:49,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:39:49,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:39:49,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:39:49,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:39:49,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:39:49,952 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:39:49,952 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:39:49,981 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:39:49,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:39:49,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:39:49,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:39:49,990 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:39:49,990 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:39:49,991 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:39:49,991 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:39:49,991 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:39:49,991 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:39:49,991 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:39:49,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:39:49,992 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:39:49,993 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:39:49,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:39:49,993 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:39:49,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:39:49,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:39:49,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:39:49,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:39:49,995 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:39:49,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:39:49,995 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:39:49,995 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:39:49,996 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:39:49,996 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:39:49,996 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:39:49,996 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:39:49,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:39:49,997 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:39:49,997 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:39:49,998 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:39:49,998 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 03:39:50,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:39:50,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:39:50,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:39:50,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:39:50,091 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:39:50,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i [2019-01-14 03:39:50,150 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91801716f/f22d96fda2c844548e7cbabc566c8bdc/FLAG0109f2202 [2019-01-14 03:39:50,553 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:39:50,554 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_true-unreach-call_true-termination.i [2019-01-14 03:39:50,558 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91801716f/f22d96fda2c844548e7cbabc566c8bdc/FLAG0109f2202 [2019-01-14 03:39:50,929 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91801716f/f22d96fda2c844548e7cbabc566c8bdc [2019-01-14 03:39:50,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:39:50,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:39:50,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:50,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:39:50,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:39:50,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:50" (1/1) ... [2019-01-14 03:39:50,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4059bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:50, skipping insertion in model container [2019-01-14 03:39:50,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:50" (1/1) ... [2019-01-14 03:39:50,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:39:50,980 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:39:51,221 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:51,227 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:39:51,259 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:51,280 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:39:51,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51 WrapperNode [2019-01-14 03:39:51,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:51,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:51,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:39:51,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:39:51,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:51,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:39:51,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:39:51,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:39:51,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... [2019-01-14 03:39:51,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:39:51,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:39:51,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:39:51,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:39:51,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:39:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:39:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:39:51,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:39:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:39:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:39:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 03:39:51,855 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:39:51,856 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 03:39:51,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:51 BoogieIcfgContainer [2019-01-14 03:39:51,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:39:51,858 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:39:51,858 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:39:51,862 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:39:51,863 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:51,863 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:39:50" (1/3) ... [2019-01-14 03:39:51,864 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a5a1a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:51, skipping insertion in model container [2019-01-14 03:39:51,864 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:51,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:51" (2/3) ... [2019-01-14 03:39:51,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a5a1a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:51, skipping insertion in model container [2019-01-14 03:39:51,865 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:51,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:51" (3/3) ... [2019-01-14 03:39:51,867 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2019-01-14 03:39:51,922 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:39:51,923 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:39:51,923 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:39:51,923 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:39:51,924 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:39:51,924 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:39:51,924 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:39:51,924 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:39:51,924 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:39:51,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 03:39:51,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 03:39:51,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:51,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:51,971 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:51,971 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:39:51,971 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:39:51,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 03:39:51,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 03:39:51,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:51,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:51,974 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:51,974 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:39:51,983 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.allocOnStack(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 [2019-01-14 03:39:51,983 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 [2019-01-14 03:39:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:39:51,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:51,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2019-01-14 03:39:52,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:52,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:39:52,171 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:39:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 03:39:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 03:39:52,186 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 03:39:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:52,193 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-14 03:39:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:39:52,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-01-14 03:39:52,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:39:52,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2019-01-14 03:39:52,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 03:39:52,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 03:39:52,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-01-14 03:39:52,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:52,205 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 03:39:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-01-14 03:39:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 03:39:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 03:39:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-14 03:39:52,236 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 03:39:52,236 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 03:39:52,237 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:39:52,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-01-14 03:39:52,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:39:52,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:52,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:52,238 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:39:52,239 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:39:52,239 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.allocOnStack(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 [2019-01-14 03:39:52,239 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 [2019-01-14 03:39:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 03:39:52,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:52,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2019-01-14 03:39:52,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:52,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2019-01-14 03:39:52,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:52,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:52,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:52,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:53,074 WARN L181 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-01-14 03:39:53,401 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 03:39:53,417 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:39:53,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:39:53,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:39:53,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:39:53,418 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:39:53,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:39:53,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:39:53,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:39:53,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-14 03:39:53,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:39:53,421 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:39:53,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,797 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 03:39:53,984 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-14 03:39:53,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:53,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:54,578 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-14 03:39:54,679 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-14 03:39:55,127 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-14 03:39:55,204 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:39:55,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:39:55,212 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 [2019-01-14 03:39:55,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,222 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 [2019-01-14 03:39:55,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,228 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 [2019-01-14 03:39:55,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,232 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 [2019-01-14 03:39:55,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,239 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 [2019-01-14 03:39:55,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,244 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 [2019-01-14 03:39:55,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,250 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 [2019-01-14 03:39:55,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,254 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 [2019-01-14 03:39:55,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:55,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:55,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,263 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 [2019-01-14 03:39:55,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,267 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 [2019-01-14 03:39:55,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,274 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 [2019-01-14 03:39:55,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,278 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 [2019-01-14 03:39:55,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,286 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 [2019-01-14 03:39:55,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:55,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:55,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:55,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,298 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 [2019-01-14 03:39:55,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:55,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:55,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:55,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:55,329 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 [2019-01-14 03:39:55,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:55,330 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:39:55,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:55,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:55,344 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:39:55,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:55,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:39:55,542 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:39:55,542 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 03:39:55,545 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:39:55,547 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:39:55,549 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:39:55,550 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 [] [2019-01-14 03:39:55,612 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 03:39:55,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:39:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:55,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:55,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:55,910 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:39:55,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 03:39:56,000 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. [2019-01-14 03:39:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:39:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:39:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 03:39:56,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 03:39:56,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:56,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 03:39:56,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:56,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-14 03:39:56,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:56,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-01-14 03:39:56,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 03:39:56,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2019-01-14 03:39:56,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 03:39:56,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 03:39:56,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 03:39:56,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:39:56,011 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 03:39:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 03:39:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-14 03:39:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 03:39:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-01-14 03:39:56,015 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 03:39:56,016 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 03:39:56,016 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:39:56,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-01-14 03:39:56,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 03:39:56,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:56,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:56,018 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:39:56,020 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:56,020 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.allocOnStack(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 [2019-01-14 03:39:56,021 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 [2019-01-14 03:39:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-01-14 03:39:56,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:56,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:56,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2019-01-14 03:39:56,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:56,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:56,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2019-01-14 03:39:56,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:56,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:56,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:56,349 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-01-14 03:39:56,508 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 03:39:56,693 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 03:39:56,703 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:39:56,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:39:56,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:39:56,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:39:56,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:39:56,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:39:56,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:39:56,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:39:56,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-14 03:39:56,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:39:56,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:39:56,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:56,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:57,103 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-14 03:39:57,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:57,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:57,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:57,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:39:57,377 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:39:57,377 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 [2019-01-14 03:39:57,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,383 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 [2019-01-14 03:39:57,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,389 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 [2019-01-14 03:39:57,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,394 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 [2019-01-14 03:39:57,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,397 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 [2019-01-14 03:39:57,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:57,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:57,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,402 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 [2019-01-14 03:39:57,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,405 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 [2019-01-14 03:39:57,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,407 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 [2019-01-14 03:39:57,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,435 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 [2019-01-14 03:39:57,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,438 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 [2019-01-14 03:39:57,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:57,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:57,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:57,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,441 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 [2019-01-14 03:39:57,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:57,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:57,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:57,451 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 [2019-01-14 03:39:57,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:57,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:57,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:57,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:57,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:57,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:57,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:39:57,496 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:39:57,496 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:39:57,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:39:57,498 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:39:57,498 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:39:57,498 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~j~0 - 1 >= 0] [2019-01-14 03:39:57,595 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 03:39:58,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:58,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:58,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:58,314 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 03:39:58,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 03:39:58,417 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 45 states and 57 transitions. Complement of second has 10 states. [2019-01-14 03:39:58,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:39:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:39:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-14 03:39:58,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 03:39:58,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:58,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 03:39:58,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:58,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 03:39:58,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:58,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2019-01-14 03:39:58,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-14 03:39:58,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 33 states and 42 transitions. [2019-01-14 03:39:58,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 03:39:58,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 03:39:58,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-01-14 03:39:58,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:39:58,429 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-01-14 03:39:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-01-14 03:39:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2019-01-14 03:39:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 03:39:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-01-14 03:39:58,432 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 03:39:58,432 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 03:39:58,432 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:39:58,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-01-14 03:39:58,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 03:39:58,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:58,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:58,434 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:39:58,434 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:39:58,434 INFO L794 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 270#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.allocOnStack(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; 271#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 272#L14-4 main_~k~0 := 1; 268#L23-3 [2019-01-14 03:39:58,434 INFO L796 eck$LassoCheckResult]: Loop: 268#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; 269#L4 assume !(0 == __VERIFIER_assert_~cond); 282#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 273#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 268#L23-3 [2019-01-14 03:39:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2019-01-14 03:39:58,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:58,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:58,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:58,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:58,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:58,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2019-01-14 03:39:58,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:58,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:58,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2019-01-14 03:39:58,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:59,134 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-01-14 03:39:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:59,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:59,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:39:59,434 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-14 03:39:59,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:39:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:39:59,435 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2019-01-14 03:39:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:59,560 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-14 03:39:59,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:39:59,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-01-14 03:39:59,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 03:39:59,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2019-01-14 03:39:59,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 03:39:59,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 03:39:59,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-01-14 03:39:59,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:39:59,565 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 03:39:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-01-14 03:39:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-14 03:39:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 03:39:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-01-14 03:39:59,570 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-01-14 03:39:59,570 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-01-14 03:39:59,570 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:39:59,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-01-14 03:39:59,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 03:39:59,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:59,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:59,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:59,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:59,572 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#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.allocOnStack(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; 330#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; 336#L17-5 main_#t~short4 := main_~i~0 >= 0; 325#L17-1 assume !main_#t~short4; 326#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 334#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 335#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 337#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; 339#L17-5 [2019-01-14 03:39:59,574 INFO L796 eck$LassoCheckResult]: Loop: 339#L17-5 main_#t~short4 := main_~i~0 >= 0; 323#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; 324#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; 339#L17-5 [2019-01-14 03:39:59,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2019-01-14 03:39:59,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:59,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:59,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:39:59,625 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:39:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2019-01-14 03:39:59,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:39:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:39:59,735 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-14 03:39:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:59,799 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2019-01-14 03:39:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:39:59,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-14 03:39:59,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-14 03:39:59,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2019-01-14 03:39:59,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 03:39:59,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 03:39:59,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2019-01-14 03:39:59,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:39:59,804 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-01-14 03:39:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2019-01-14 03:39:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-01-14 03:39:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 03:39:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-14 03:39:59,811 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 03:39:59,811 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-14 03:39:59,812 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:39:59,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-01-14 03:39:59,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 03:39:59,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:59,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:59,813 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:59,813 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:39:59,814 INFO L794 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 404#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.allocOnStack(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; 405#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; 409#L17-5 main_#t~short4 := main_~i~0 >= 0; 400#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; 401#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 413#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 414#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 410#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 406#L14-4 main_~k~0 := 1; 402#L23-3 [2019-01-14 03:39:59,815 INFO L796 eck$LassoCheckResult]: Loop: 402#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; 403#L4 assume !(0 == __VERIFIER_assert_~cond); 416#L4-2 havoc main_#t~mem8;havoc main_#t~mem7; 407#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 402#L23-3 [2019-01-14 03:39:59,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2019-01-14 03:39:59,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:59,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2019-01-14 03:39:59,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:59,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:59,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2019-01-14 03:39:59,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:59,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:00,270 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-01-14 03:40:00,681 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-01-14 03:40:00,866 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-14 03:40:00,869 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:00,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:00,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:00,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:00,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:00,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:00,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:00,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:00,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-14 03:40:00,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:00,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:00,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:00,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:01,290 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-01-14 03:40:01,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:01,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:01,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:01,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:01,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:01,692 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:01,692 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 [2019-01-14 03:40:01,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,697 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 [2019-01-14 03:40:01,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,701 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 [2019-01-14 03:40:01,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,703 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 [2019-01-14 03:40:01,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:01,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:01,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,707 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 [2019-01-14 03:40:01,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,709 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 [2019-01-14 03:40:01,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,711 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 [2019-01-14 03:40:01,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,713 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 [2019-01-14 03:40:01,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,716 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 [2019-01-14 03:40:01,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:01,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:01,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:01,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:01,718 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 [2019-01-14 03:40:01,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:01,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:01,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:01,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:01,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:01,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:01,746 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:01,759 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:40:01,760 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:40:01,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:01,761 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:01,761 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:01,761 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 [] [2019-01-14 03:40:01,862 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 03:40:01,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:01,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:01,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:01,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-14 03:40:01,941 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. [2019-01-14 03:40:01,942 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 [2019-01-14 03:40:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-14 03:40:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 03:40:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 03:40:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-14 03:40:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:01,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-01-14 03:40:01,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:40:01,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2019-01-14 03:40:01,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 03:40:01,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 03:40:01,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-01-14 03:40:01,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:01,950 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 03:40:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-01-14 03:40:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-14 03:40:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 03:40:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-01-14 03:40:01,952 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 03:40:01,952 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 03:40:01,952 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:40:01,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-01-14 03:40:01,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:40:01,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:01,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:01,954 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 03:40:01,954 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:40:01,954 INFO L794 eck$LassoCheckResult]: Stem: 548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 542#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.allocOnStack(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; 543#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; 549#L17-5 main_#t~short4 := main_~i~0 >= 0; 563#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 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 553#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 554#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 550#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; 552#L17-5 main_#t~short4 := main_~i~0 >= 0; 544#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; 545#L17-3 [2019-01-14 03:40:01,954 INFO L796 eck$LassoCheckResult]: Loop: 545#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; 555#L17-5 main_#t~short4 := main_~i~0 >= 0; 556#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; 545#L17-3 [2019-01-14 03:40:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2019-01-14 03:40:01,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:01,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2019-01-14 03:40:02,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2019-01-14 03:40:02,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:02,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,625 WARN L181 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-01-14 03:40:02,728 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 03:40:03,092 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2019-01-14 03:40:03,452 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-14 03:40:03,471 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:03,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:03,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:03,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:03,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:03,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:03,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:03,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:03,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-14 03:40:03,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:03,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:03,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:03,876 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-14 03:40:04,103 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-14 03:40:04,541 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-14 03:40:04,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:04,638 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:04,638 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 [2019-01-14 03:40:04,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,641 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 [2019-01-14 03:40:04,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,642 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 [2019-01-14 03:40:04,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:04,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:04,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,645 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 [2019-01-14 03:40:04,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,647 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 [2019-01-14 03:40:04,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,649 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 [2019-01-14 03:40:04,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:04,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:04,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,656 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 [2019-01-14 03:40:04,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,661 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 [2019-01-14 03:40:04,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,664 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 [2019-01-14 03:40:04,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,671 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 [2019-01-14 03:40:04,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,676 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 [2019-01-14 03:40:04,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:04,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:04,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:04,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,678 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 [2019-01-14 03:40:04,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:04,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:04,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:04,686 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 [2019-01-14 03:40:04,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:04,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:04,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:04,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:04,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:04,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:04,707 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:04,720 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 03:40:04,720 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 03:40:04,720 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:04,722 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:04,723 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:04,723 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 03:40:04,793 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 03:40:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:04,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:04,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:04,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 03:40:04,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 03:40:05,003 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. [2019-01-14 03:40:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:40:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-14 03:40:05,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 03:40:05,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:05,006 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:40:05,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:05,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:05,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:05,079 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 [2019-01-14 03:40:05,080 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 03:40:05,133 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. [2019-01-14 03:40:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:40:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-14 03:40:05,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 03:40:05,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:05,138 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:40:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:05,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:05,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:05,206 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 [2019-01-14 03:40:05,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 03:40:05,276 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. [2019-01-14 03:40:05,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:40:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 03:40:05,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-14 03:40:05,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:05,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:40:05,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:05,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 03:40:05,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:05,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2019-01-14 03:40:05,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:40:05,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-01-14 03:40:05,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:40:05,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:40:05,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:40:05,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:05,286 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:40:05,286 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:40:05,286 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:40:05,287 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:40:05,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:40:05,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:40:05,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:40:05,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:40:05 BoogieIcfgContainer [2019-01-14 03:40:05,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:40:05,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:40:05,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:40:05,294 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:40:05,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:51" (3/4) ... [2019-01-14 03:40:05,298 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:40:05,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:40:05,299 INFO L168 Benchmark]: Toolchain (without parser) took 14366.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -63.5 MB). Peak memory consumption was 240.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:40:05,300 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:40:05,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:40:05,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:40:05,303 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:40:05,303 INFO L168 Benchmark]: RCFGBuilder took 510.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:40:05,305 INFO L168 Benchmark]: BuchiAutomizer took 13435.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.2 MB). Peak memory consumption was 264.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:40:05,306 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:40:05,310 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 39.30 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.98 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 510.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13435.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.2 MB). Peak memory consumption was 264.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 + j and consists of 6 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 13.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 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: 106 SDtfs, 145 SDslu, 65 SDs, 0 SdLazy, 168 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf99 lsp84 ukn79 mio100 lsp65 div196 bol100 ite100 ukn100 eq149 hnf60 smp89 dnf152 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 219ms VariablesStem: 6 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...