./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash f36e762e796a59800b85d8514c20c7f73c19b5c1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:32:01,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:32:01,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:32:01,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:32:01,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:32:01,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:32:01,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:32:01,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:32:01,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:32:01,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:32:01,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:32:01,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:32:01,800 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:32:01,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:32:01,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:32:01,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:32:01,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:32:01,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:32:01,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:32:01,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:32:01,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:32:01,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:32:01,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:32:01,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:32:01,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:32:01,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:32:01,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:32:01,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:32:01,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:32:01,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:32:01,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:32:01,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:32:01,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:32:01,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:32:01,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:32:01,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:32:01,827 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:32:01,844 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:32:01,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:32:01,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:32:01,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:32:01,846 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:32:01,846 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:32:01,846 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:32:01,847 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:32:01,847 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:32:01,847 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:32:01,847 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:32:01,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:32:01,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:32:01,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:32:01,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:32:01,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:32:01,848 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:32:01,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:32:01,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:32:01,849 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:32:01,849 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:32:01,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:32:01,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:32:01,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:32:01,850 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:32:01,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:32:01,852 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:32:01,853 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:32:01,853 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:32:01,854 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f36e762e796a59800b85d8514c20c7f73c19b5c1 [2019-01-01 21:32:01,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:32:01,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:32:01,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:32:01,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:32:01,919 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:32:01,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:01,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694f843cd/f8feabe6cb1a4fb6851b4ecdc19ebf7c/FLAG1181562e6 [2019-01-01 21:32:02,415 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:32:02,415 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:02,422 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694f843cd/f8feabe6cb1a4fb6851b4ecdc19ebf7c/FLAG1181562e6 [2019-01-01 21:32:02,805 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694f843cd/f8feabe6cb1a4fb6851b4ecdc19ebf7c [2019-01-01 21:32:02,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:32:02,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:32:02,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:02,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:32:02,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:32:02,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:02" (1/1) ... [2019-01-01 21:32:02,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b06401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:02, skipping insertion in model container [2019-01-01 21:32:02,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:02" (1/1) ... [2019-01-01 21:32:02,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:32:02,851 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:32:03,091 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:03,097 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:32:03,117 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:03,135 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:32:03,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03 WrapperNode [2019-01-01 21:32:03,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:03,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:03,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:32:03,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:32:03,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:03,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:32:03,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:32:03,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:32:03,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:32:03,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:32:03,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:32:03,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:32:03,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:32:03,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:32:03,471 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:32:03,471 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:32:03,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:03 BoogieIcfgContainer [2019-01-01 21:32:03,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:32:03,472 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:32:03,472 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:32:03,476 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:32:03,476 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:03,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:32:02" (1/3) ... [2019-01-01 21:32:03,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bb1f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:03, skipping insertion in model container [2019-01-01 21:32:03,478 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:03,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (2/3) ... [2019-01-01 21:32:03,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bb1f4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:03, skipping insertion in model container [2019-01-01 21:32:03,479 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:03,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:03" (3/3) ... [2019-01-01 21:32:03,482 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:03,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:32:03,544 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:32:03,544 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:32:03,544 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:32:03,545 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:32:03,545 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:32:03,545 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:32:03,545 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:32:03,545 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:32:03,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:32:03,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:03,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:03,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:03,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:32:03,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:03,590 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:32:03,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:32:03,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:03,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:03,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:03,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:32:03,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:03,601 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 8#L15-2true [2019-01-01 21:32:03,602 INFO L796 eck$LassoCheckResult]: Loop: 8#L15-2true assume !!(main_~c~0 > 0); 3#L15true assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 8#L15-2true [2019-01-01 21:32:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:32:03,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:03,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:03,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:32:03,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:03,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:03,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:03,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:32:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:03,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:03,885 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:32:03,983 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:03,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:03,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:03,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:03,985 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:03,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:03,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:03,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:03,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:03,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:03,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:04,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,293 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:04,295 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:32:04,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:04,304 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:04,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:04,349 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:04,371 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:04,371 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:04,377 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:04,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:04,428 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:04,430 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:04,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:04,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:04,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:04,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:04,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:04,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:04,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:04,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:04,432 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:04,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,808 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:04,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:04,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:04,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:04,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:04,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:04,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:04,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:04,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:04,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:04,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:04,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:04,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:04,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:04,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:04,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:04,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:04,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:04,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:04,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:04,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:04,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:04,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:04,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:04,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:04,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:04,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:04,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:04,899 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:04,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:04,902 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:04,902 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:04,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:04,904 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:04,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:04,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:05,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:32:05,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:32:05,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-01 21:32:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:32:05,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:32:05,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:05,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:32:05,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:05,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:32:05,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:05,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:32:05,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:05,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-01 21:32:05,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:32:05,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:32:05,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-01 21:32:05,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:05,125 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:32:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-01 21:32:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:32:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:32:05,154 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:32:05,154 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:32:05,155 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:32:05,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:32:05,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:05,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:05,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:05,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:32:05,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:05,157 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 68#L15-2 assume !!(main_~c~0 > 0); 63#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 64#L15-2 [2019-01-01 21:32:05,157 INFO L796 eck$LassoCheckResult]: Loop: 64#L15-2 assume !!(main_~c~0 > 0); 69#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 64#L15-2 [2019-01-01 21:32:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-01 21:32:05,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:05,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-01 21:32:05,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:05,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:05,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:05,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-01 21:32:05,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:05,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,284 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:05,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:05,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:05,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:05,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:05,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:05,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:05,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:05,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:05,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:05,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:05,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,443 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:05,443 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:05,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:05,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:05,488 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:05,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 21:32:05,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:05,496 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:32:05,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:05,524 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:05,548 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:05,550 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:05,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:05,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:05,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:05,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:05,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:05,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:05,551 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:05,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:05,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:05,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:05,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:05,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-01-01 21:32:05,752 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:32:06,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:06,073 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:06,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:06,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:06,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:06,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:06,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:06,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:06,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:06,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:06,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:06,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:06,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:06,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:06,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:06,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:06,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:06,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:06,091 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:06,094 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:06,095 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:06,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:06,095 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:06,095 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:06,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-01 21:32:06,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:06,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:06,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:06,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:06,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:32:06,318 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:32:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:32:06,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:32:06,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:06,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:32:06,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:06,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:32:06,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:06,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-01 21:32:06,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:06,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:32:06,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:32:06,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:32:06,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-01 21:32:06,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:06,324 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:32:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-01 21:32:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:32:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-01 21:32:06,326 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:32:06,326 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-01 21:32:06,327 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:32:06,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-01 21:32:06,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:32:06,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:06,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:06,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:06,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:06,329 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 122#L15-2 assume !!(main_~c~0 > 0); 117#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 118#L15-2 assume !!(main_~c~0 > 0); 125#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 123#L15-2 [2019-01-01 21:32:06,329 INFO L796 eck$LassoCheckResult]: Loop: 123#L15-2 assume !!(main_~c~0 > 0); 124#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 123#L15-2 [2019-01-01 21:32:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-01 21:32:06,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:06,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:06,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:06,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-01 21:32:06,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:06,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:06,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:06,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-01-01 21:32:06,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:06,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:06,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,397 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:06,397 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:06,397 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:06,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:06,398 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:06,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:06,398 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:06,398 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:06,398 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:06,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:06,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:06,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,522 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:06,522 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:06,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:06,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:06,547 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:06,547 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:06,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:06,555 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:06,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:06,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:06,600 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:06,602 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:06,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:06,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:06,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:06,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:06,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:06,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:06,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:06,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:06,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:06,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:06,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,778 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:06,779 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:06,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:06,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:06,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:06,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:06,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:06,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:06,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:06,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:06,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:06,790 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:06,790 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:06,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:06,791 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:06,791 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:06,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-01 21:32:06,791 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:06,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:06,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:06,888 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:06,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:32:06,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:32:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:32:06,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:32:06,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:06,910 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:06,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:06,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:07,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:07,031 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-01-01 21:32:07,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:32:07,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-01 21:32:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:32:07,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:32:07,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,059 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:07,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:07,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:07,130 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-01-01 21:32:07,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:32:07,145 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-01-01 21:32:07,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:07,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:32:07,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:32:07,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:32:07,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-01 21:32:07,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:07,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-01 21:32:07,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:32:07,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:32:07,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-01 21:32:07,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:07,152 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-01 21:32:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-01 21:32:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-01 21:32:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-01 21:32:07,156 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:32:07,156 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-01 21:32:07,156 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:32:07,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-01 21:32:07,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:07,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:07,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:07,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:32:07,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:07,157 INFO L794 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 265#L15-2 [2019-01-01 21:32:07,158 INFO L796 eck$LassoCheckResult]: Loop: 265#L15-2 assume !!(main_~c~0 > 0); 264#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 265#L15-2 [2019-01-01 21:32:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:32:07,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:07,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:07,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-01-01 21:32:07,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,172 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-01 21:32:07,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:07,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:07,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,249 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:07,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:07,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:07,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:07,249 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:07,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:07,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:07,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:07,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:32:07,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:07,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:07,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:07,363 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:32:07,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:07,371 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:07,397 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:07,397 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 21:32:07,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:07,405 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:32:07,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:07,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:07,438 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:07,438 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 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-01-01 21:32:07,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:07,459 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:32:07,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:07,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:07,504 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:07,506 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:07,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:07,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:07,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:07,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:07,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:07,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:07,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:07,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:32:07,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:07,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:07,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:07,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:07,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:07,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:07,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:07,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:07,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:07,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:07,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:07,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:07,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:07,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:07,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:07,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:07,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:07,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:07,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:07,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:07,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:07,633 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:07,636 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:07,636 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:07,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:07,637 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:07,637 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:07,637 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-01-01 21:32:07,637 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:07,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:07,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:07,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:07,697 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:32:07,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:32:07,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:32:07,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-01 21:32:07,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:32:07,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:32:07,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:32:07,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:07,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-01-01 21:32:07,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:07,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-01-01 21:32:07,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:32:07,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:32:07,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-01 21:32:07,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:07,718 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-01 21:32:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-01 21:32:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-01 21:32:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:32:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-01-01 21:32:07,721 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-01 21:32:07,721 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-01 21:32:07,721 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:32:07,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-01-01 21:32:07,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:07,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:07,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:07,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:32:07,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:32:07,726 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 314#L15-2 assume !!(main_~c~0 > 0); 315#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 316#L15-2 assume !!(main_~c~0 > 0); 309#L15 [2019-01-01 21:32:07,726 INFO L796 eck$LassoCheckResult]: Loop: 309#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 310#L15-2 assume !!(main_~c~0 > 0); 309#L15 [2019-01-01 21:32:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,727 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:32:07,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:07,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:07,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:07,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:32:07,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:32:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:32:07,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:07,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:07,802 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:07,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:07,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:07,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:07,803 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:07,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:07,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:07,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:07,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-01 21:32:07,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:07,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:07,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:07,904 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:07,904 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:07,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:07,910 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:07,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:07,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:07,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:07,968 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}] Lambdas: [3, 12, 1] Nus: [0, 0] 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:07,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:07,990 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:08,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:08,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:08,060 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:08,062 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:08,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:08,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:08,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:08,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:08,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:08,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:08,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:08,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-01 21:32:08,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:08,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:08,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:08,224 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:08,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:08,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:08,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:08,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:08,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:08,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:08,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:08,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:08,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:08,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:08,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:08,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:08,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:08,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:08,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:08,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:08,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:08,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:08,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:08,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:08,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:08,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:08,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:08,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:08,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:08,239 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:08,242 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:08,242 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:08,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:08,242 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:08,243 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:08,243 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-01-01 21:32:08,243 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:08,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:08,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:08,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:32:08,389 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:32:08,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-01-01 21:32:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:32:08,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:08,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:08,402 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:08,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:08,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:08,443 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-01-01 21:32:08,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:32:08,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:32:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:08,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:08,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:08,508 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:08,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:08,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:08,624 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-01-01 21:32:08,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:32:08,636 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-01-01 21:32:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:32:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:32:08,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:32:08,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:08,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:32:08,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:08,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:32:08,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:08,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-01 21:32:08,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:32:08,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-01-01 21:32:08,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:32:08,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:32:08,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:32:08,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:08,641 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:32:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:32:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-01-01 21:32:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:32:08,645 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:32:08,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:32:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:32:08,651 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-01-01 21:32:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:08,687 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-01 21:32:08,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:32:08,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-01 21:32:08,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:08,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-01-01 21:32:08,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:32:08,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:32:08,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-01 21:32:08,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:08,691 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:32:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-01 21:32:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-01 21:32:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:32:08,692 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:32:08,692 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:32:08,692 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:32:08,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:32:08,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:32:08,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:08,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:08,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-01-01 21:32:08,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:32:08,694 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 463#L15-2 assume !!(main_~c~0 > 0); 461#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 460#L15-2 assume !!(main_~c~0 > 0); 464#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 465#L15-2 assume !!(main_~c~0 > 0); 459#L15 [2019-01-01 21:32:08,694 INFO L796 eck$LassoCheckResult]: Loop: 459#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 460#L15-2 assume !!(main_~c~0 > 0); 464#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 465#L15-2 assume !!(main_~c~0 > 0); 459#L15 [2019-01-01 21:32:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-01-01 21:32:08,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:08,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-01 21:32:08,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:08,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-01-01 21:32:08,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:08,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:08,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:08,781 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:08,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:08,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:08,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:08,782 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:08,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:08,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:08,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:08,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-01 21:32:08,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:08,783 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:08,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:08,902 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:32:08,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:08,907 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:08,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:08,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:08,954 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:08,971 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:08,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:08,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:08,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:08,972 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:08,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:08,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:08,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:08,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-01 21:32:08,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:08,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:08,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:08,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:09,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:09,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:09,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:09,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:09,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:09,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:09,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:09,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:09,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:09,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:09,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:09,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:09,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:09,098 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:09,098 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:09,098 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:09,098 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:09,098 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2019-01-01 21:32:09,101 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:09,177 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:09,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:32:09,195 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:32:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-01 21:32:09,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:32:09,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,197 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:09,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:09,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:32:09,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-01-01 21:32:09,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:09,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:32:09,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,354 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:09,416 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:09,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:32:09,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-01-01 21:32:09,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:32:09,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:32:09,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,430 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:09,496 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:09,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:32:09,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-01-01 21:32:09,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:09,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:32:09,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,536 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:09,680 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:09,681 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:32:09,821 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-01-01 21:32:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-01 21:32:09,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:32:09,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:32:09,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:32:09,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:09,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-01-01 21:32:09,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:32:09,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-01-01 21:32:09,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-01 21:32:09,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-01 21:32:09,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-01-01 21:32:09,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:09,842 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-01-01 21:32:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-01-01 21:32:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-01-01 21:32:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:32:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-01-01 21:32:09,848 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-01 21:32:09,848 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-01 21:32:09,848 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:32:09,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-01-01 21:32:09,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:32:09,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:09,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:09,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-01-01 21:32:09,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-01 21:32:09,857 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 828#L15-2 assume !!(main_~c~0 > 0); 825#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 824#L15-2 assume !!(main_~c~0 > 0); 833#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 832#L15-2 assume !!(main_~c~0 > 0); 831#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 830#L15-2 assume !!(main_~c~0 > 0); 823#L15 [2019-01-01 21:32:09,857 INFO L796 eck$LassoCheckResult]: Loop: 823#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 824#L15-2 assume !!(main_~c~0 > 0); 833#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 832#L15-2 assume !!(main_~c~0 > 0); 831#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 830#L15-2 assume !!(main_~c~0 > 0); 823#L15 [2019-01-01 21:32:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-01-01 21:32:09,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:09,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:09,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:09,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:09,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:09,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:09,930 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:32:09,942 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-01 21:32:09,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:09,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:09,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:09,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 21:32:09,965 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:32:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-01-01 21:32:09,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:09,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:09,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:10,047 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:10,047 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:10,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:10,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:10,048 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:10,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:10,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:10,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:10,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-01 21:32:10,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:10,048 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:10,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:10,135 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 21:32:10,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:10,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:10,158 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:10,159 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 21:32:10,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:10,163 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 21:32:10,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:10,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:10,257 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:10,258 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:10,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:10,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:10,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:10,259 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:10,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:10,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:10,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:10,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-01 21:32:10,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:10,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:10,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:10,352 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:10,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:10,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:10,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:10,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:10,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:10,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:10,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:10,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:10,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:10,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:10,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:10,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:10,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:10,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:10,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:10,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:10,363 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:10,364 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:10,364 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:10,365 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:10,365 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:10,365 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:10,365 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:10,365 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:10,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:10,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:10,569 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:32:10,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-01 21:32:10,600 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 65 states and 87 transitions. Complement of second has 9 states. [2019-01-01 21:32:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:32:10,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:32:10,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:10,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 21:32:10,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:10,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-01-01 21:32:10,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:10,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2019-01-01 21:32:10,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:32:10,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2019-01-01 21:32:10,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:32:10,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:32:10,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2019-01-01 21:32:10,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:10,608 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-01-01 21:32:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2019-01-01 21:32:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-01-01 21:32:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:32:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2019-01-01 21:32:10,616 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2019-01-01 21:32:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:32:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:32:10,616 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2019-01-01 21:32:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:10,641 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-01-01 21:32:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:32:10,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2019-01-01 21:32:10,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:32:10,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2019-01-01 21:32:10,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-01 21:32:10,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-01 21:32:10,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-01-01 21:32:10,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:10,646 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-01 21:32:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-01-01 21:32:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-01-01 21:32:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:32:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-01 21:32:10,649 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:32:10,649 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 21:32:10,649 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:32:10,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-01 21:32:10,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:32:10,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:10,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:10,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-01-01 21:32:10,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-01 21:32:10,651 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1096#L15-2 assume !!(main_~c~0 > 0); 1111#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1108#L15-2 assume !!(main_~c~0 > 0); 1101#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1092#L15-2 assume !!(main_~c~0 > 0); 1102#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1100#L15-2 assume !!(main_~c~0 > 0); 1099#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1098#L15-2 assume !!(main_~c~0 > 0); 1091#L15 [2019-01-01 21:32:10,651 INFO L796 eck$LassoCheckResult]: Loop: 1091#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1092#L15-2 assume !!(main_~c~0 > 0); 1102#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1100#L15-2 assume !!(main_~c~0 > 0); 1099#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1098#L15-2 assume !!(main_~c~0 > 0); 1091#L15 [2019-01-01 21:32:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-01-01 21:32:10,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:10,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:10,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-01-01 21:32:10,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:10,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:10,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-01-01 21:32:10,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:10,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:10,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:10,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:10,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:10,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:10,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:10,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:10,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 21:32:10,907 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:10,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:10,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:10,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:10,907 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:10,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:10,908 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:10,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:10,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2019-01-01 21:32:10,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:10,908 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:10,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:10,988 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:10,988 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:10,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:10,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:11,014 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:11,014 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:11,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:11,018 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:11,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:11,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:11,117 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:11,119 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:11,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:11,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:11,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:11,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:11,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:11,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:11,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:11,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2019-01-01 21:32:11,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:11,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:11,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:11,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:11,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:11,201 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:11,201 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:11,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:11,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:11,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:11,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:11,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:11,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:11,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:11,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:11,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:11,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:11,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:11,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:11,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:11,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:11,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:11,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:11,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:11,212 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:11,213 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:11,213 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:11,213 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:11,213 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:11,213 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:11,214 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:11,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:11,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:11,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:32:11,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:32:11,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-01-01 21:32:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-01 21:32:11,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:32:11,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:11,682 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:11,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:11,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:11,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:32:11,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:32:11,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-01-01 21:32:11,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-01 21:32:11,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:32:11,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:11,796 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:11,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:11,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:11,931 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:32:11,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:32:11,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-01-01 21:32:11,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 21:32:11,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:32:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-01 21:32:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-01-01 21:32:11,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:11,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-01-01 21:32:11,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-01-01 21:32:11,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-01-01 21:32:11,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-01 21:32:12,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-01 21:32:12,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-01-01 21:32:12,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:12,000 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-01-01 21:32:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-01-01 21:32:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-01 21:32:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:32:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-01-01 21:32:12,005 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-01-01 21:32:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:32:12,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:32:12,006 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2019-01-01 21:32:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:12,051 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-01-01 21:32:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:32:12,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2019-01-01 21:32:12,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-01 21:32:12,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2019-01-01 21:32:12,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-01 21:32:12,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:32:12,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-01-01 21:32:12,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:12,058 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-01-01 21:32:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-01-01 21:32:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-01-01 21:32:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:32:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-01 21:32:12,061 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 21:32:12,061 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 21:32:12,061 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:32:12,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-01-01 21:32:12,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:32:12,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:12,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:12,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:12,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-01-01 21:32:12,063 INFO L794 eck$LassoCheckResult]: Stem: 1638#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1640#L15-2 assume !!(main_~c~0 > 0); 1654#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1649#L15-2 assume !!(main_~c~0 > 0); 1645#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1646#L15-2 [2019-01-01 21:32:12,063 INFO L796 eck$LassoCheckResult]: Loop: 1646#L15-2 assume !!(main_~c~0 > 0); 1643#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1644#L15-2 assume !!(main_~c~0 > 0); 1648#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1641#L15-2 assume !!(main_~c~0 > 0); 1634#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1635#L15-2 assume !!(main_~c~0 > 0); 1645#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1646#L15-2 [2019-01-01 21:32:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:12,064 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-01-01 21:32:12,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:12,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:12,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:12,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-01-01 21:32:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:12,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:12,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:32:12,130 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:32:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:32:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:32:12,131 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 21:32:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:12,150 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-01 21:32:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:32:12,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-01-01 21:32:12,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:32:12,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-01-01 21:32:12,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:32:12,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:32:12,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-01-01 21:32:12,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:12,156 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-01-01 21:32:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-01-01 21:32:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-01 21:32:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:32:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-01-01 21:32:12,160 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-01 21:32:12,160 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-01 21:32:12,160 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:32:12,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-01-01 21:32:12,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:32:12,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:12,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:12,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:12,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-01-01 21:32:12,162 INFO L794 eck$LassoCheckResult]: Stem: 1729#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1731#L15-2 assume !!(main_~c~0 > 0); 1745#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1740#L15-2 assume !!(main_~c~0 > 0); 1736#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1732#L15-2 [2019-01-01 21:32:12,162 INFO L796 eck$LassoCheckResult]: Loop: 1732#L15-2 assume !!(main_~c~0 > 0); 1733#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1735#L15-2 assume !!(main_~c~0 > 0); 1741#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1739#L15-2 assume !!(main_~c~0 > 0); 1725#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1726#L15-2 assume !!(main_~c~0 > 0); 1744#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1742#L15-2 assume !!(main_~c~0 > 0); 1738#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1732#L15-2 [2019-01-01 21:32:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-01-01 21:32:12,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-01-01 21:32:12,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:12,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:12,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-01-01 21:32:12,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:12,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:12,357 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-01 21:32:12,371 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:12,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:12,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:12,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:12,372 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:12,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:12,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:12,372 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:12,372 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2019-01-01 21:32:12,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:12,373 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:12,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:12,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:12,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:12,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:12,565 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:12,566 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:12,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:12,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:12,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:12,591 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:12,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:12,597 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:12,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:12,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:12,626 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:12,645 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:12,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:12,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:12,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:12,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:12,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:12,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:12,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:12,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2019-01-01 21:32:12,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:12,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:12,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-01-01 21:32:12,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:12,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-01-01 21:32:12,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:12,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:12,729 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:12,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:12,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:12,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:12,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:12,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:12,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:12,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:12,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:12,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:12,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:12,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:12,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:12,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:12,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:12,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:12,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:12,740 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:12,741 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:12,741 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:12,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:12,742 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:12,742 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:12,742 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:12,742 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:12,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:12,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:13,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:32:13,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:32:13,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:32:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:32:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,027 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:13,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:32:13,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:32:13,185 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:32:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:13,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:32:13,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,186 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:13,305 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 5 loop predicates [2019-01-01 21:32:13,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:32:13,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-01-01 21:32:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:32:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,316 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:13,420 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:32:13,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:32:13,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-01-01 21:32:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:32:13,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:32:13,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,478 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:13,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:13,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:13,602 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:32:13,602 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:32:13,677 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,677 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,678 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,678 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,679 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,727 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,728 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,728 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,728 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,728 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:13,740 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-01-01 21:32:13,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:32:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-01-01 21:32:13,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:32:13,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-01-01 21:32:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-01-01 21:32:13,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:13,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-01-01 21:32:13,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-01-01 21:32:13,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-01-01 21:32:13,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:32:13,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:32:13,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-01-01 21:32:13,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:13,778 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-01-01 21:32:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-01-01 21:32:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-01-01 21:32:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 21:32:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-01-01 21:32:13,785 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-01 21:32:13,785 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-01 21:32:13,785 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:32:13,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-01-01 21:32:13,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-01 21:32:13,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:13,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:13,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:13,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-01-01 21:32:13,787 INFO L794 eck$LassoCheckResult]: Stem: 2722#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 2725#L15-2 assume !!(main_~c~0 > 0); 2753#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2742#L15-2 assume !!(main_~c~0 > 0); 2730#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2727#L15-2 [2019-01-01 21:32:13,787 INFO L796 eck$LassoCheckResult]: Loop: 2727#L15-2 assume !!(main_~c~0 > 0); 2728#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2779#L15-2 assume !!(main_~c~0 > 0); 2773#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2771#L15-2 assume !!(main_~c~0 > 0); 2765#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2764#L15-2 assume !!(main_~c~0 > 0); 2763#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2755#L15-2 assume !!(main_~c~0 > 0); 2734#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2747#L15-2 assume !!(main_~c~0 > 0); 2745#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2744#L15-2 assume !!(main_~c~0 > 0); 2732#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2727#L15-2 [2019-01-01 21:32:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-01-01 21:32:13,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:13,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-01-01 21:32:13,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:13,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-01-01 21:32:13,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:13,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:13,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:13,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:13,962 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-01-01 21:32:13,986 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:13,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:13,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:13,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:13,987 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:13,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:13,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:13,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:13,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2019-01-01 21:32:13,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:13,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:13,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:13,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:14,072 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:14,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:14,078 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:14,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:14,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:14,114 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:14,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:14,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:14,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:14,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:14,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:14,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:14,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:14,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:14,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2019-01-01 21:32:14,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:14,142 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:14,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:14,212 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:14,212 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:14,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:14,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:14,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:14,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:14,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:14,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:14,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:14,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:14,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:14,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:14,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:14,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:14,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:14,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:14,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:14,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:14,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:14,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:14,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:14,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:14,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:14,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:14,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:14,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:14,236 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:14,237 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:14,237 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:14,238 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:14,241 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:14,241 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:14,241 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:14,241 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:14,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:32:14,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:32:14,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-01-01 21:32:14,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:14,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:32:14,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:14,409 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:14,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:32:14,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:32:14,665 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-01-01 21:32:14,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:14,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:32:14,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:14,667 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:14,775 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 7 loop predicates [2019-01-01 21:32:14,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:32:14,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-01-01 21:32:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:14,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:32:14,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:14,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:14,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:14,917 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:32:14,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:32:14,956 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-01-01 21:32:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:32:14,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:32:14,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:14,958 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:14,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:15,097 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-01 21:32:15,097 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-01 21:32:15,258 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,258 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,264 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,264 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,265 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,265 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,267 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,268 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,382 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,383 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,383 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,383 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,383 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,392 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,392 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,395 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,397 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,508 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:15,583 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-01-01 21:32:15,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-01-01 21:32:15,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:32:15,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:15,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-01-01 21:32:15,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:15,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-01-01 21:32:15,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:15,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-01-01 21:32:15,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-01 21:32:15,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-01-01 21:32:15,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:32:15,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:32:15,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-01-01 21:32:15,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:15,621 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-01-01 21:32:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-01-01 21:32:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-01-01 21:32:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-01 21:32:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-01-01 21:32:15,642 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-01 21:32:15,642 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-01 21:32:15,642 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:32:15,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-01-01 21:32:15,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-01 21:32:15,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:15,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:15,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:15,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-01-01 21:32:15,648 INFO L794 eck$LassoCheckResult]: Stem: 5635#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 5640#L15-2 assume !!(main_~c~0 > 0); 5680#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5650#L15-2 assume !!(main_~c~0 > 0); 5647#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5644#L15-2 [2019-01-01 21:32:15,648 INFO L796 eck$LassoCheckResult]: Loop: 5644#L15-2 assume !!(main_~c~0 > 0); 5645#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5848#L15-2 assume !!(main_~c~0 > 0); 5778#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5776#L15-2 assume !!(main_~c~0 > 0); 5774#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5772#L15-2 assume !!(main_~c~0 > 0); 5768#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5769#L15-2 assume !!(main_~c~0 > 0); 5751#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5752#L15-2 assume !!(main_~c~0 > 0); 5748#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5749#L15-2 assume !!(main_~c~0 > 0); 5652#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5674#L15-2 assume !!(main_~c~0 > 0); 5653#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5651#L15-2 assume !!(main_~c~0 > 0); 5649#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5644#L15-2 [2019-01-01 21:32:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-01-01 21:32:15,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:15,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:15,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:15,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:15,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-01-01 21:32:15,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:15,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-01-01 21:32:15,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:15,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:15,980 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-01-01 21:32:15,992 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:15,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:15,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:15,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:15,992 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:15,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:15,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:15,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:15,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2019-01-01 21:32:15,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:15,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:15,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:16,058 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:16,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:16,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:16,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:16,083 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:16,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:16,089 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:16,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:16,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:16,132 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:16,133 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:16,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:16,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:16,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:16,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:16,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:16,134 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:16,134 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:16,134 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2019-01-01 21:32:16,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:16,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:16,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:16,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:16,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:16,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:16,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:16,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:16,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:16,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:16,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:16,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:16,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:16,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:16,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:16,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:16,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:16,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:16,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:16,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:16,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:16,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:16,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:16,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:16,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:16,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:16,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:16,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:16,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:16,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:16,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:16,272 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:16,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:16,272 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:16,273 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:16,273 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:16,276 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:16,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:16,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:16,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-01 21:32:16,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-01 21:32:16,426 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-01-01 21:32:16,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:16,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:32:16,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:16,435 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:16,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:16,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:17,113 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-01 21:32:17,113 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-01 21:32:17,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-01-01 21:32:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:17,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:32:17,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:17,132 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:17,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:17,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:17,350 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 9 loop predicates [2019-01-01 21:32:17,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-01 21:32:17,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 392 states and 537 transitions. Complement of second has 4 states. [2019-01-01 21:32:17,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:17,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:32:17,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:17,387 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:17,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:17,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:17,720 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-01 21:32:17,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-01 21:32:17,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 455 states and 606 transitions. Complement of second has 8 states. [2019-01-01 21:32:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:32:17,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:32:17,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:17,779 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:17,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:17,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:17,977 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-01 21:32:17,977 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-01 21:32:18,315 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,316 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,316 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,316 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,317 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,317 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,318 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,319 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,319 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,321 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,321 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,321 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,321 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,321 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,321 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,322 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,322 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,323 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,323 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,323 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,323 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,323 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,324 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,554 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,554 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,554 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,554 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,555 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,555 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,555 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,555 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,556 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,556 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,556 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,557 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,557 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,558 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,559 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,560 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,560 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,561 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,561 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,562 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,563 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,564 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,565 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,566 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,567 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,568 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,568 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,814 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,815 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,816 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,817 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,819 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,821 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,822 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,823 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,824 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,826 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,827 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,828 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,828 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,829 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,830 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,831 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,832 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,833 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,834 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,840 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,841 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,921 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,922 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,924 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,925 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,926 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,927 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,927 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,928 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:18,968 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. Result 5484 states and 8953 transitions. Complement of second has 178 states 20 powerset states158 rank states. The highest rank that occured is 7 [2019-01-01 21:32:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:32:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2019-01-01 21:32:18,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-01 21:32:18,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:18,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2019-01-01 21:32:18,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:18,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2019-01-01 21:32:18,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:18,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2019-01-01 21:32:19,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-01-01 21:32:19,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2019-01-01 21:32:19,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:32:19,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:32:19,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2019-01-01 21:32:19,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:19,037 INFO L705 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2019-01-01 21:32:19,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2019-01-01 21:32:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2019-01-01 21:32:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-01-01 21:32:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2019-01-01 21:32:19,075 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-01-01 21:32:19,075 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-01-01 21:32:19,075 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 21:32:19,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2019-01-01 21:32:19,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 21:32:19,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:19,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:19,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:19,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2019-01-01 21:32:19,080 INFO L794 eck$LassoCheckResult]: Stem: 13388#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 13397#L15-2 assume !!(main_~c~0 > 0); 13474#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13413#L15-2 assume !!(main_~c~0 > 0); 13409#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13405#L15-2 [2019-01-01 21:32:19,080 INFO L796 eck$LassoCheckResult]: Loop: 13405#L15-2 assume !!(main_~c~0 > 0); 13406#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 14038#L15-2 assume !!(main_~c~0 > 0); 13902#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13900#L15-2 assume !!(main_~c~0 > 0); 13898#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13896#L15-2 assume !!(main_~c~0 > 0); 13894#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13890#L15-2 assume !!(main_~c~0 > 0); 13888#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13886#L15-2 assume !!(main_~c~0 > 0); 13882#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13883#L15-2 assume !!(main_~c~0 > 0); 13868#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13709#L15-2 assume !!(main_~c~0 > 0); 13866#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13867#L15-2 assume !!(main_~c~0 > 0); 13412#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13415#L15-2 assume !!(main_~c~0 > 0); 13414#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13411#L15-2 assume !!(main_~c~0 > 0); 13408#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13405#L15-2 [2019-01-01 21:32:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2019-01-01 21:32:19,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:19,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:19,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:19,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:19,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:19,087 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2019-01-01 21:32:19,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:19,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:19,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:19,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:19,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2019-01-01 21:32:19,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:19,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:19,365 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-01-01 21:32:19,375 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:19,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:19,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:19,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:19,376 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:19,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:19,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:19,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:19,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2019-01-01 21:32:19,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:19,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:19,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:19,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:19,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:19,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:19,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:19,469 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:19,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:19,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:19,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:19,494 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:19,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:19,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:19,519 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:19,519 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:19,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:19,525 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:19,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:19,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:19,568 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:19,570 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:19,570 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:19,570 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:19,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:19,570 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:19,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:19,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:19,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:19,571 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2019-01-01 21:32:19,571 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:19,571 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:19,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:19,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-01-01 21:32:19,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-01-01 21:32:19,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:19,642 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:19,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:19,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:19,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:19,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:19,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:19,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:19,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:19,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:19,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:19,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:19,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:19,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:19,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:19,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:19,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:19,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:19,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:19,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:19,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:19,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:19,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:19,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:19,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:19,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:19,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:19,669 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:19,669 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:19,670 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:19,670 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:19,670 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:19,670 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-01 21:32:19,670 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:19,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:19,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:19,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-01 21:32:19,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-01 21:32:19,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-01-01 21:32:19,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:32:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:19,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-01 21:32:19,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:19,867 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:19,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:19,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:20,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-01 21:32:20,008 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-01 21:32:20,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-01-01 21:32:20,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:32:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:20,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-01 21:32:20,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:20,018 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:20,200 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 11 loop predicates [2019-01-01 21:32:20,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-01 21:32:20,210 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 996 states and 1456 transitions. Complement of second has 4 states. [2019-01-01 21:32:20,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:32:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:32:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-01 21:32:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:20,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:20,367 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-01 21:32:20,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-01 21:32:20,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 1149 states and 1623 transitions. Complement of second has 8 states. [2019-01-01 21:32:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:32:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:32:20,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-01 21:32:20,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:20,451 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:20,610 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-01 21:32:20,610 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-01 21:32:20,843 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,844 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,845 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,845 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,845 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,845 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,846 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,852 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,852 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,852 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,853 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,853 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,854 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,857 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,857 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,858 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,858 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,858 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,858 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,858 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,859 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,862 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,863 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,865 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,866 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,866 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,866 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,866 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,867 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,867 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,867 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,867 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,867 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,870 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,870 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,870 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,871 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,873 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,873 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,873 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,873 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,874 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,877 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,877 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,877 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,877 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,878 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,944 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,944 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,944 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,944 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,945 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,945 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,945 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,945 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,948 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,949 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,949 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,949 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,950 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,950 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,950 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,950 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,951 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,951 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,952 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,952 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,952 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,953 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,953 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,953 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,954 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,954 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,954 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,954 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,955 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,955 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,955 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,955 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,956 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,956 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,956 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,956 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,956 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,956 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,957 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,958 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,959 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,959 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,959 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,959 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,959 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,959 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,960 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,961 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,962 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,964 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,965 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,966 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,966 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,966 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,966 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,967 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,968 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,968 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,968 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,968 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,969 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,969 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,969 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,969 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,970 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,971 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,972 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,973 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,974 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,975 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,976 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:20,976 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,073 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,081 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,083 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,083 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,085 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,086 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,086 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,086 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,086 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,086 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,086 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,087 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,087 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,087 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,087 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,087 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,087 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,088 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,089 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,089 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,089 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,089 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,089 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,089 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,090 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,091 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,091 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,091 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,091 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,091 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,091 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,092 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,093 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,093 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,093 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,093 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,093 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,094 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,095 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,095 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,095 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,095 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,095 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,095 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,096 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,096 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,096 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,096 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,096 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,096 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,097 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,097 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,097 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,097 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,097 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,097 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,098 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,098 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,099 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,099 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,099 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,099 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,100 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,100 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,101 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,101 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,101 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,102 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,103 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,104 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,104 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,105 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,105 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,105 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,105 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,106 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,106 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,107 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,107 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,107 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,107 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,108 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,109 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,110 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,268 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,268 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,268 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,268 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,268 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,269 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,271 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,271 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,271 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,271 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,271 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,272 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,273 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,279 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,280 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,282 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,283 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,284 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,285 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,286 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,287 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,288 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,289 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,290 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,291 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,292 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,293 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,294 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,295 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,296 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,297 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,298 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,299 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,300 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,301 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,301 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,302 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,302 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,302 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,302 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,303 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,303 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,303 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,304 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,305 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,305 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,503 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,504 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,506 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,507 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,509 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,510 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,511 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,512 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,513 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,514 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,515 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,516 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,517 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,518 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,519 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,520 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,521 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,522 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,523 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,524 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-01 21:32:21,587 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. Result 14845 states and 25888 transitions. Complement of second has 212 states 24 powerset states188 rank states. The highest rank that occured is 7 [2019-01-01 21:32:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:32:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2019-01-01 21:32:21,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-01 21:32:21,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:21,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2019-01-01 21:32:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:21,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2019-01-01 21:32:21,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:21,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2019-01-01 21:32:21,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-01 21:32:21,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2019-01-01 21:32:21,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:32:21,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:32:21,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2019-01-01 21:32:21,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:21,727 INFO L705 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2019-01-01 21:32:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2019-01-01 21:32:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2019-01-01 21:32:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-01-01 21:32:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2019-01-01 21:32:21,777 INFO L728 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-01-01 21:32:21,777 INFO L608 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-01-01 21:32:21,777 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 21:32:21,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2019-01-01 21:32:21,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-01-01 21:32:21,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:21,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:21,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-01 21:32:21,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2019-01-01 21:32:21,785 INFO L794 eck$LassoCheckResult]: Stem: 33138#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 33155#L15-2 assume !!(main_~c~0 > 0); 33312#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33177#L15-2 assume !!(main_~c~0 > 0); 33174#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33171#L15-2 [2019-01-01 21:32:21,785 INFO L796 eck$LassoCheckResult]: Loop: 33171#L15-2 assume !!(main_~c~0 > 0); 33172#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34732#L15-2 assume !!(main_~c~0 > 0); 34321#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34320#L15-2 assume !!(main_~c~0 > 0); 34319#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34318#L15-2 assume !!(main_~c~0 > 0); 34317#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34316#L15-2 assume !!(main_~c~0 > 0); 34315#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34314#L15-2 assume !!(main_~c~0 > 0); 34313#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34312#L15-2 assume !!(main_~c~0 > 0); 34311#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34033#L15-2 assume !!(main_~c~0 > 0); 34310#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34309#L15-2 assume !!(main_~c~0 > 0); 34308#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33681#L15-2 assume !!(main_~c~0 > 0); 34307#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34305#L15-2 assume !!(main_~c~0 > 0); 33179#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33181#L15-2 assume !!(main_~c~0 > 0); 33180#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 33178#L15-2 assume !!(main_~c~0 > 0); 33176#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33171#L15-2 [2019-01-01 21:32:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2019-01-01 21:32:21,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2019-01-01 21:32:21,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:21,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2019-01-01 21:32:21,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:21,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:22,395 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-01-01 21:32:22,406 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:22,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:22,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:22,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:22,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:22,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:22,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:22,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:22,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2019-01-01 21:32:22,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:22,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:22,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:22,471 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:22,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:22,475 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:22,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:22,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:22,518 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:22,519 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:22,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:22,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:22,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:22,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:22,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:22,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:22,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:22,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2019-01-01 21:32:22,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:22,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:22,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:22,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:22,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:22,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:22,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:22,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:22,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:22,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:22,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:32:22,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:32:22,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:22,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:22,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:22,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:22,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:22,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:22,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:22,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:22,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:22,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:22,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:22,606 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:22,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:22,610 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:22,610 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:22,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-01 21:32:22,610 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-01 21:32:22,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:32:22,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-01 21:32:22,778 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-01-01 21:32:22,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:32:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:22,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-01 21:32:22,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:22,780 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-01 21:32:22,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:32:22,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-01 21:32:22,871 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-01-01 21:32:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:32:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:32:22,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-01 21:32:22,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:22,873 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:22,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-01 21:32:22,951 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 6 loop predicates [2019-01-01 21:32:22,951 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-01 21:32:22,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 2364 states and 3787 transitions. Complement of second has 7 states. [2019-01-01 21:32:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:32:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-01 21:32:23,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-01 21:32:23,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:23,000 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:23,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:23,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-01 21:32:23,277 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 21:32:23,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-01 21:32:23,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 3111 states and 5286 transitions. Complement of second has 12 states. [2019-01-01 21:32:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:32:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-01-01 21:32:23,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-01 21:32:23,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:23,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2019-01-01 21:32:23,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:23,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2019-01-01 21:32:23,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:23,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2019-01-01 21:32:23,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:23,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2019-01-01 21:32:23,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:23,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:23,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:23,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:23,352 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:23,352 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:23,352 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:23,352 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 21:32:23,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:32:23,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:23,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:32:23,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:32:23 BoogieIcfgContainer [2019-01-01 21:32:23,360 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:32:23,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:32:23,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:32:23,360 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:32:23,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:03" (3/4) ... [2019-01-01 21:32:23,365 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:32:23,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:32:23,366 INFO L168 Benchmark]: Toolchain (without parser) took 20555.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 952.7 MB in the beginning and 956.1 MB in the end (delta: -3.4 MB). Peak memory consumption was 343.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:23,367 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:23,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.52 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:23,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.29 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:23,368 INFO L168 Benchmark]: Boogie Preprocessor took 18.46 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:23,369 INFO L168 Benchmark]: RCFGBuilder took 277.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:23,369 INFO L168 Benchmark]: BuchiAutomizer took 19887.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 125.7 MB). Peak memory consumption was 371.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:23,370 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.4 GB. Free memory is still 956.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:23,374 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.52 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.29 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.46 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 277.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19887.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 956.1 MB in the end (delta: 125.7 MB). Peak memory consumption was 371.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.4 GB. Free memory is still 956.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (4 trivial, 4 deterministic, 9 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One deterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 201 and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function n and consists of 13 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.8s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 8.5s. Construction of modules took 1.7s. Büchi inclusion checks took 8.9s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 3169 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1604 states and ocurred in iteration 13. Nontrivial modules had stage [4, 0, 3, 1, 5]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 254/414 HoareTripleCheckerStatistics: 213 SDtfs, 253 SDslu, 127 SDs, 0 SdLazy, 376 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT10 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf98 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp97 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...