./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.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 3e28603c63113c1566dc2e06da17c63059f80486 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:52:52,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:52,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:52,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:52,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:52,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:52,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:52,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:52,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:52,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:52,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:52,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:52,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:52,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:52,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:52,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:52,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:52,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:52,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:52,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:52,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:52,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:52,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:52,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:52,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:52,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:52,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:52,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:52,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:52,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:52,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:52,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:52,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:52,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:52,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:52,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:52,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:52,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:52,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:52,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:52,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:52,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:52,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:52,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:52,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:52,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:52,644 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:52,644 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:52,644 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:52,644 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:52,645 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:52,648 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:52,648 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:52,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:52,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:52,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:52,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:52,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:52,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:52,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:52,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:52,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:52,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:52,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:52,652 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:52,652 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:52,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:52,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:52,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:52,653 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:52,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:52,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:52,653 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:52,654 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:52,656 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 3e28603c63113c1566dc2e06da17c63059f80486 [2019-11-28 03:52:52,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:53,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:53,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:53,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:53,007 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:53,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2019-11-28 03:52:53,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85a412e1/5f7a866d5ac340efbed1fd578418f18a/FLAGc417b74ff [2019-11-28 03:52:53,562 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:53,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2019-11-28 03:52:53,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85a412e1/5f7a866d5ac340efbed1fd578418f18a/FLAGc417b74ff [2019-11-28 03:52:53,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85a412e1/5f7a866d5ac340efbed1fd578418f18a [2019-11-28 03:52:53,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:53,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:53,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:53,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:53,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:53,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:53" (1/1) ... [2019-11-28 03:52:53,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c09576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:53, skipping insertion in model container [2019-11-28 03:52:53,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:53" (1/1) ... [2019-11-28 03:52:53,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:53,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:54,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:54,414 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:54,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:54,508 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:54,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54 WrapperNode [2019-11-28 03:52:54,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:54,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:54,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:54,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:54,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:54,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:54,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:54,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:54,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (1/1) ... [2019-11-28 03:52:54,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:54,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:54,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:54,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:54,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (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-11-28 03:52:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:54,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:54,991 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:54,991 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:52:54,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:54 BoogieIcfgContainer [2019-11-28 03:52:54,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:54,993 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:54,993 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:54,997 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:54,997 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:54,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:53" (1/3) ... [2019-11-28 03:52:54,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a4cae73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:54, skipping insertion in model container [2019-11-28 03:52:54,999 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:54,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:54" (2/3) ... [2019-11-28 03:52:55,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a4cae73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:54, skipping insertion in model container [2019-11-28 03:52:55,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:55,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:54" (3/3) ... [2019-11-28 03:52:55,002 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2019-11-28 03:52:55,044 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:55,044 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:55,044 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:55,044 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:55,045 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:55,045 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:55,045 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:55,045 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:55,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:52:55,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:52:55,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:55,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:55,086 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:52:55,087 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:55,087 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:55,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:52:55,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:52:55,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:55,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:55,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:52:55,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:55,097 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L516true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 7#L516-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 18#L518true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 4#L519-3true [2019-11-28 03:52:55,097 INFO L796 eck$LassoCheckResult]: Loop: 4#L519-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 13#L521true assume main_~val~0 < 0;main_~val~0 := 0; 16#L521-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 20#L519-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4#L519-3true [2019-11-28 03:52:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 03:52:55,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:55,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521779936] [2019-11-28 03:52:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-11-28 03:52:55,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:55,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055555969] [2019-11-28 03:52:55,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-11-28 03:52:55,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:55,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968867535] [2019-11-28 03:52:55,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:55,350 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:55,569 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-11-28 03:52:55,624 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:55,625 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:55,625 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:55,625 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:55,626 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:55,626 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:55,626 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:55,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:55,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2019-11-28 03:52:55,627 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:55,628 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:55,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,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-11-28 03:52:55,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:55,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-11-28 03:52:55,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:56,223 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:56,230 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:56,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:56,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:56,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:56,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:56,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:56,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:56,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:56,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:56,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:56,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:56,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:56,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:56,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:56,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:56,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:56,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:56,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:56,481 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-28 03:52:56,481 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:56,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:56,504 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:56,504 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:56,505 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-28 03:52:56,525 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:56,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:56,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:56,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:56,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:56,650 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-11-28 03:52:56,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-28 03:52:56,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-11-28 03:52:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-11-28 03:52:56,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 03:52:56,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:56,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 03:52:56,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:56,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-28 03:52:56,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:56,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-11-28 03:52:56,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:56,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-11-28 03:52:56,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:52:56,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:52:56,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-28 03:52:56,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:56,751 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:52:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-28 03:52:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 03:52:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:52:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-28 03:52:56,784 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:52:56,784 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:52:56,785 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:56,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-28 03:52:56,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:56,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:56,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:56,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:56,787 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:56,788 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 138#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 127#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 128#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 137#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 129#L519-3 assume !(main_~i~0 < main_~length~0); 130#L519-4 main_~j~0 := 0; 136#L526-3 [2019-11-28 03:52:56,788 INFO L796 eck$LassoCheckResult]: Loop: 136#L526-3 assume !!(main_~j~0 < main_~length~0); 135#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 133#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 134#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 136#L526-3 [2019-11-28 03:52:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-11-28 03:52:56,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718639770] [2019-11-28 03:52:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:56,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718639770] [2019-11-28 03:52:56,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:56,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:52:56,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096284875] [2019-11-28 03:52:56,863 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-11-28 03:52:56,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:56,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732690263] [2019-11-28 03:52:56,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:56,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:56,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:56,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:56,939 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:52:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:56,979 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-28 03:52:56,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:56,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-28 03:52:56,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:56,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-11-28 03:52:56,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:52:56,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:52:56,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-11-28 03:52:56,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:56,987 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-28 03:52:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-11-28 03:52:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-28 03:52:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:52:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:52:56,990 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:52:56,991 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:52:56,991 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:56,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 03:52:56,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:56,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:56,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:56,995 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:56,995 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:56,995 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 178#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 167#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 168#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 177#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 169#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 170#L521 assume !(main_~val~0 < 0); 179#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 181#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 171#L519-3 assume !(main_~i~0 < main_~length~0); 172#L519-4 main_~j~0 := 0; 176#L526-3 [2019-11-28 03:52:56,996 INFO L796 eck$LassoCheckResult]: Loop: 176#L526-3 assume !!(main_~j~0 < main_~length~0); 175#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 173#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 174#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 176#L526-3 [2019-11-28 03:52:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:56,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-11-28 03:52:56,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:56,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123011019] [2019-11-28 03:52:56,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-11-28 03:52:57,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:57,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798777241] [2019-11-28 03:52:57,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,083 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-11-28 03:52:57,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:57,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862149186] [2019-11-28 03:52:57,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:57,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:57,334 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-11-28 03:52:57,402 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:57,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:57,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:57,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:57,403 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:57,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:57,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:57,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration3_Lasso [2019-11-28 03:52:57,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:57,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:57,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:57,915 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:57,915 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:57,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:57,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:57,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:57,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:57,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:57,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:57,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:57,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:57,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:57,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:57,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:57,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:57,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:58,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:58,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:58,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:58,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:58,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:58,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:58,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:58,108 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 03:52:58,108 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:58,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:58,128 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:58,128 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [] [2019-11-28 03:52:58,171 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:58,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:58,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:58,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:58,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:58,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:58,229 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-11-28 03:52:58,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 03:52:58,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-11-28 03:52:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:52:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-28 03:52:58,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-28 03:52:58,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:58,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 03:52:58,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-28 03:52:58,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:58,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-11-28 03:52:58,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:58,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2019-11-28 03:52:58,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:52:58,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:52:58,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-28 03:52:58,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:58,257 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-28 03:52:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-28 03:52:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-28 03:52:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:52:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-28 03:52:58,261 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 03:52:58,261 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 03:52:58,261 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:58,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-28 03:52:58,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:58,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:58,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:58,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:58,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:58,263 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 297#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 287#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 288#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 295#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 283#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 284#L521 assume !(main_~val~0 < 0); 298#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 300#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 285#L519-3 assume !(main_~i~0 < main_~length~0); 286#L519-4 main_~j~0 := 0; 294#L526-3 assume !!(main_~j~0 < main_~length~0); 290#L527-3 [2019-11-28 03:52:58,263 INFO L796 eck$LassoCheckResult]: Loop: 290#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 289#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 290#L527-3 [2019-11-28 03:52:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-11-28 03:52:58,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:58,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003739533] [2019-11-28 03:52:58,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:58,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-11-28 03:52:58,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:58,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269760909] [2019-11-28 03:52:58,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:58,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:58,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-11-28 03:52:58,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:58,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390971315] [2019-11-28 03:52:58,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:58,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:58,525 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-28 03:52:58,573 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:58,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:58,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:58,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:58,574 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:58,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:58,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:58,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:58,575 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2019-11-28 03:52:58,575 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:58,575 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:58,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,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-11-28 03:52:58,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,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-11-28 03:52:58,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:58,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:59,083 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:59,083 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:59,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:59,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:59,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:59,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:59,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:59,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:59,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:59,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:59,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:59,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:59,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:59,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:59,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:59,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:59,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:59,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:59,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:59,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:59,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:59,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:59,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:59,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:52:59,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:59,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:59,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:59,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:59,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:59,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:59,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:59,367 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:52:59,367 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:59,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:59,375 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:59,375 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:59,375 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_2 Supporting invariants [] [2019-11-28 03:52:59,387 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:52:59,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:52:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:59,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:52:59,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:59,461 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:52:59,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:52:59,516 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2019-11-28 03:52:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:52:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-28 03:52:59,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 03:52:59,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:59,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-28 03:52:59,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:59,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-28 03:52:59,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:59,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-11-28 03:52:59,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:59,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-11-28 03:52:59,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:52:59,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:52:59,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-11-28 03:52:59,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:59,521 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-28 03:52:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-11-28 03:52:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-28 03:52:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 03:52:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-28 03:52:59,524 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 03:52:59,524 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 03:52:59,524 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:52:59,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-11-28 03:52:59,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:59,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:59,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:59,526 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:59,526 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:59,526 INFO L794 eck$LassoCheckResult]: Stem: 435#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 433#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 421#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 422#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 428#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 417#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 418#L521 assume !(main_~val~0 < 0); 434#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 436#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 419#L519-3 assume !(main_~i~0 < main_~length~0); 420#L519-4 main_~j~0 := 0; 427#L526-3 assume !!(main_~j~0 < main_~length~0); 426#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 437#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 429#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 430#L526-3 assume !!(main_~j~0 < main_~length~0); 424#L527-3 [2019-11-28 03:52:59,526 INFO L796 eck$LassoCheckResult]: Loop: 424#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 423#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 424#L527-3 [2019-11-28 03:52:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-11-28 03:52:59,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207124519] [2019-11-28 03:52:59,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:59,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207124519] [2019-11-28 03:52:59,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090894925] [2019-11-28 03:52:59,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:59,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:52:59,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:59,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:52:59,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:59,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:59,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-28 03:52:59,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787493186] [2019-11-28 03:52:59,754 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-11-28 03:52:59,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:59,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797746796] [2019-11-28 03:52:59,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:59,772 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:59,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 03:52:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-28 03:52:59,801 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-11-28 03:53:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:53:00,143 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-11-28 03:53:00,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 03:53:00,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-11-28 03:53:00,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:00,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-11-28 03:53:00,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:53:00,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:53:00,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-28 03:53:00,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:53:00,148 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 03:53:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-28 03:53:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-28 03:53:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:53:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-28 03:53:00,151 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-28 03:53:00,151 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-28 03:53:00,151 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:53:00,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-28 03:53:00,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:53:00,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:53:00,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:53:00,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:53:00,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:53:00,153 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 577#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 564#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 565#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 572#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 560#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 561#L521 assume !(main_~val~0 < 0); 584#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 583#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 562#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 563#L521 assume !(main_~val~0 < 0); 578#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 580#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 581#L519-3 assume !(main_~i~0 < main_~length~0); 570#L519-4 main_~j~0 := 0; 571#L526-3 assume !!(main_~j~0 < main_~length~0); 569#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 582#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 575#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 576#L526-3 assume !!(main_~j~0 < main_~length~0); 567#L527-3 [2019-11-28 03:53:00,153 INFO L796 eck$LassoCheckResult]: Loop: 567#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 566#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 567#L527-3 [2019-11-28 03:53:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-11-28 03:53:00,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:00,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413457784] [2019-11-28 03:53:00,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:00,184 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-11-28 03:53:00,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:00,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76007002] [2019-11-28 03:53:00,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:00,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:00,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-11-28 03:53:00,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:53:00,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798534166] [2019-11-28 03:53:00,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:53:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:53:00,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:53:00,550 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 89 [2019-11-28 03:53:00,624 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:53:00,624 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:53:00,625 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:53:00,625 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:53:00,625 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:53:00,625 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:00,625 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:53:00,625 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:53:00,626 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration6_Lasso [2019-11-28 03:53:00,626 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:53:00,626 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:53:00,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,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-11-28 03:53:00,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,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-11-28 03:53:00,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:53:00,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-11-28 03:53:01,059 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:53:01,060 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:01,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:01,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:01,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:01,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:53:01,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:53:01,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:53:01,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:53:01,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:53:01,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:53:01,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:53:01,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:53:01,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:53:01,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:53:01,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:53:01,211 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:53:01,211 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:53:01,216 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:53:01,216 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:53:01,216 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:53:01,216 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:53:01,226 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:53:01,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:53:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:01,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:01,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:01,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:53:01,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:01,274 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-11-28 03:53:01,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:53:01,292 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-11-28 03:53:01,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 03:53:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-11-28 03:53:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:01,294 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:53:01,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:01,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:01,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:01,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:53:01,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:01,336 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:53:01,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:53:01,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-11-28 03:53:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 03:53:01,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-11-28 03:53:01,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:01,354 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:53:01,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:53:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:01,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:53:01,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:53:01,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:53:01,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:53:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:53:01,405 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 2 loop predicates [2019-11-28 03:53:01,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:53:01,419 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-11-28 03:53:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:53:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:53:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-28 03:53:01,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-11-28 03:53:01,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:01,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-11-28 03:53:01,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:01,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-11-28 03:53:01,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:53:01,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-11-28 03:53:01,422 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:53:01,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-11-28 03:53:01,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:53:01,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:53:01,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:53:01,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:53:01,423 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:01,423 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:01,423 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:53:01,423 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:53:01,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:53:01,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:53:01,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:53:01,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:53:01 BoogieIcfgContainer [2019-11-28 03:53:01,430 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:53:01,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:53:01,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:53:01,431 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:53:01,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:54" (3/4) ... [2019-11-28 03:53:01,435 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:53:01,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:53:01,437 INFO L168 Benchmark]: Toolchain (without parser) took 7523.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 153.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:01,437 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:01,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:01,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:01,440 INFO L168 Benchmark]: Boogie Preprocessor took 30.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:01,441 INFO L168 Benchmark]: RCFGBuilder took 402.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:01,441 INFO L168 Benchmark]: BuchiAutomizer took 6437.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.2 MB). Peak memory consumption was 143.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:53:01,442 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:53:01,445 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 594.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6437.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.2 MB). Peak memory consumption was 143.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.50 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[arr] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 223 SDslu, 84 SDs, 0 SdLazy, 192 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax113 hnf98 lsp82 ukn79 mio100 lsp57 div100 bol100 ite100 ukn100 eq160 hnf90 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...