./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.23-635dfa2 [2018-12-01 19:16:08,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:16:08,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:16:08,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:16:08,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:16:08,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:16:08,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:16:08,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:16:08,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:16:08,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:16:08,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:16:08,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:16:08,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:16:08,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:16:08,820 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:16:08,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:16:08,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:16:08,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:16:08,824 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:16:08,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:16:08,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:16:08,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:16:08,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:16:08,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:16:08,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:16:08,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:16:08,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:16:08,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:16:08,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:16:08,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:16:08,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:16:08,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:16:08,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:16:08,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:16:08,833 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:16:08,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:16:08,833 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 19:16:08,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:16:08,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:16:08,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:16:08,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:16:08,845 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:16:08,846 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 19:16:08,846 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 19:16:08,846 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 19:16:08,846 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 19:16:08,846 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 19:16:08,846 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 19:16:08,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:16:08,847 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 19:16:08,848 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:16:08,848 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 19:16:08,848 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:16:08,848 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:16:08,848 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 19:16:08,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:16:08,848 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:16:08,848 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 19:16:08,849 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 19:16:08,849 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f36e762e796a59800b85d8514c20c7f73c19b5c1 [2018-12-01 19:16:08,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:16:08,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:16:08,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:16:08,884 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:16:08,884 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:16:08,885 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-01 19:16:08,925 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/data/28cdc4360/96950e2e636c42458bcf9f246f86d54e/FLAG34fd71788 [2018-12-01 19:16:09,311 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:16:09,311 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-01 19:16:09,314 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/data/28cdc4360/96950e2e636c42458bcf9f246f86d54e/FLAG34fd71788 [2018-12-01 19:16:09,745 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/data/28cdc4360/96950e2e636c42458bcf9f246f86d54e [2018-12-01 19:16:09,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:16:09,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:16:09,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:16:09,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:16:09,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:16:09,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643eada2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09, skipping insertion in model container [2018-12-01 19:16:09,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:16:09,768 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:16:09,854 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:16:09,856 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:16:09,865 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:16:09,873 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:16:09,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09 WrapperNode [2018-12-01 19:16:09,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:16:09,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:16:09,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:16:09,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:16:09,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:16:09,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:16:09,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:16:09,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:16:09,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... [2018-12-01 19:16:09,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:16:09,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:16:09,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:16:09,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:16:09,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:16:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:16:10,041 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:16:10,041 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 19:16:10,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:16:10 BoogieIcfgContainer [2018-12-01 19:16:10,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:16:10,042 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 19:16:10,042 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 19:16:10,044 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 19:16:10,045 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:16:10,045 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 07:16:09" (1/3) ... [2018-12-01 19:16:10,046 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dc69f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:16:10, skipping insertion in model container [2018-12-01 19:16:10,046 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:16:10,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:16:09" (2/3) ... [2018-12-01 19:16:10,046 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dc69f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:16:10, skipping insertion in model container [2018-12-01 19:16:10,046 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:16:10,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:16:10" (3/3) ... [2018-12-01 19:16:10,047 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-01 19:16:10,080 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:16:10,081 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 19:16:10,081 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 19:16:10,081 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 19:16:10,081 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:16:10,081 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:16:10,081 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 19:16:10,081 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:16:10,081 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 19:16:10,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-12-01 19:16:10,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 19:16:10,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:10,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:10,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 19:16:10,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 19:16:10,105 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 19:16:10,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-12-01 19:16:10,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 19:16:10,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:10,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:10,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 19:16:10,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 19:16:10,111 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 [2018-12-01 19:16:10,111 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 [2018-12-01 19:16:10,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-01 19:16:10,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:10,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-12-01 19:16:10,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-12-01 19:16:10,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:10,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,231 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:10,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:10,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:10,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:10,232 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:10,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,233 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:10,233 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:10,233 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-12-01 19:16:10,233 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:10,233 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:10,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16: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 [2018-12-01 19:16:10,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:10,329 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,355 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:10,355 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:10,373 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,376 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:10,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,408 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:10,409 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:10,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:10,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:10,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:10,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:10,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:10,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:10,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-12-01 19:16:10,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:10,410 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:10,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,456 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:10,459 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:10,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:10,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:10,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:10,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:10,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:10,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:10,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:10,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:10,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:10,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:10,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:10,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:10,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:10,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:10,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:10,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:10,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:10,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:10,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:10,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:10,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:10,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:10,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:10,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:10,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:10,492 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:10,492 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:10,493 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:10,493 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:10,493 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:10,494 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:10,494 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:10,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:10,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:10,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:10,533 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 [2018-12-01 19:16:10,534 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-12-01 19:16:10,559 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. [2018-12-01 19:16:10,560 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 [2018-12-01 19:16:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-01 19:16:10,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-12-01 19:16:10,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:10,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-01 19:16:10,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:10,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-01 19:16:10,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:10,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-01 19:16:10,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 19:16:10,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-12-01 19:16:10,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-01 19:16:10,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-01 19:16:10,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-12-01 19:16:10,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:10,569 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-01 19:16:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-12-01 19:16:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-01 19:16:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-01 19:16:10,584 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-01 19:16:10,584 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-01 19:16:10,584 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 19:16:10,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-12-01 19:16:10,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 19:16:10,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:10,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:10,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 19:16:10,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 19:16:10,585 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 [2018-12-01 19:16:10,585 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 [2018-12-01 19:16:10,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-12-01 19:16:10,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:10,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-12-01 19:16:10,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-12-01 19:16:10,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:10,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,621 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:10,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:10,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:10,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:10,621 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:10,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:10,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:10,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-12-01 19:16:10,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:10,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:10,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:10,672 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:10,697 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,700 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:10,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,732 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:10,733 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:10,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:10,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:10,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:10,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:10,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:10,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:10,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-12-01 19:16:10,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:10,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:10,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:10,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:10,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:10,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:10,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:10,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:10,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:10,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:10,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:10,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:10,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:10,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:10,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:10,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:10,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:10,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:10,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:10,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:10,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:10,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:10,777 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:10,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:10,777 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:10,777 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:10,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-01 19:16:10,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:10,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:10,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:10,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:10,805 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 19:16:10,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-01 19:16:10,812 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. [2018-12-01 19:16:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-01 19:16:10,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-01 19:16:10,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:10,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 19:16:10,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:10,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-01 19:16:10,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:10,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-12-01 19:16:10,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 19:16:10,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-12-01 19:16:10,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-01 19:16:10,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-01 19:16:10,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-12-01 19:16:10,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:10,815 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-01 19:16:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-12-01 19:16:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-01 19:16:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 19:16:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-12-01 19:16:10,816 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-01 19:16:10,816 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-12-01 19:16:10,816 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 19:16:10,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-12-01 19:16:10,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 19:16:10,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:10,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:10,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:10,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 19:16:10,817 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 [2018-12-01 19:16:10,817 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 [2018-12-01 19:16:10,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-12-01 19:16:10,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:10,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-12-01 19:16:10,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-12-01 19:16:10,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:10,845 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:10,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:10,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:10,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:10,846 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:10,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:10,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:10,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-12-01 19:16:10,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:10,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:10,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:10,888 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:10,904 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:10,907 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:10,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:10,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:10,939 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:10,939 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:10,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:10,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:10,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:10,940 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:10,940 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:10,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:10,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:10,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-12-01 19:16:10,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:10,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:10,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:10,988 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:10,989 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:10,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:10,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:10,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:10,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:10,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:10,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:10,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:10,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:10,992 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:10,994 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:10,994 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:10,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:10,994 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:10,994 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:10,995 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-01 19:16:10,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:11,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 19:16:11,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-01 19:16:11,024 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. [2018-12-01 19:16:11,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-01 19:16:11,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 19:16:11,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,025 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,045 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 [2018-12-01 19:16:11,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-01 19:16:11,051 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. [2018-12-01 19:16:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-12-01 19:16:11,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 19:16:11,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,052 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,070 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 [2018-12-01 19:16:11,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-01 19:16:11,076 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. [2018-12-01 19:16:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 19:16:11,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 19:16:11,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 19:16:11,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 19:16:11,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-12-01 19:16:11,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 19:16:11,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-12-01 19:16:11,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-01 19:16:11,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-01 19:16:11,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-12-01 19:16:11,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:11,078 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-01 19:16:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-12-01 19:16:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-12-01 19:16:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 19:16:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-01 19:16:11,079 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-01 19:16:11,079 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-01 19:16:11,079 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 19:16:11,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-12-01 19:16:11,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 19:16:11,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:11,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:11,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-01 19:16:11,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 19:16:11,080 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 [2018-12-01 19:16:11,080 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 [2018-12-01 19:16:11,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-01 19:16:11,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-12-01 19:16:11,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:11,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-12-01 19:16:11,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,105 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:11,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:11,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:11,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:11,106 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:11,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:11,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:11,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:11,106 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-12-01 19:16:11,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:11,106 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:11,147 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:11,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:11,164 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:11,164 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:11,166 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:11,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:11,187 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:11,187 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:11,202 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:11,220 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:11,236 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:11,237 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:11,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:11,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:11,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:11,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:11,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:11,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:11,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:11,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-12-01 19:16:11,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:11,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:11,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:11,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:11,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:11,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:11,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:11,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:11,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:11,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:11,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:11,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:11,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:11,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:11,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:11,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:11,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:11,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:11,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:11,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:11,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:11,297 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:11,299 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:11,299 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 19:16:11,299 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:11,299 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:11,299 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:11,299 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-12-01 19:16:11,300 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:11,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,316 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 [2018-12-01 19:16:11,316 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-01 19:16:11,321 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. [2018-12-01 19:16:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-12-01 19:16:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-12-01 19:16:11,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-01 19:16:11,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-01 19:16:11,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-12-01 19:16:11,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 19:16:11,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-12-01 19:16:11,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-01 19:16:11,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-12-01 19:16:11,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-12-01 19:16:11,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:11,322 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-12-01 19:16:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-12-01 19:16:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-01 19:16:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 19:16:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-12-01 19:16:11,323 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-12-01 19:16:11,323 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-12-01 19:16:11,323 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 19:16:11,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-12-01 19:16:11,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 19:16:11,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:11,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:11,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-12-01 19:16:11,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 19:16:11,325 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 [2018-12-01 19:16:11,325 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 [2018-12-01 19:16:11,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-12-01 19:16:11,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:16:11,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 19:16:11,348 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 19:16:11,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-12-01 19:16:11,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,362 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:11,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:11,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:11,362 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:11,362 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:11,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:11,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:11,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:11,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-12-01 19:16:11,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:11,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:11,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,402 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:11,402 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:11,404 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:11,419 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:11,446 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:11,446 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:11,460 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:11,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:11,492 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:11,493 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:11,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:11,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:11,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:11,494 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:11,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:11,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:11,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:11,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-12-01 19:16:11,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:11,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:11,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,531 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:11,532 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:11,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:11,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:11,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:11,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:11,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:11,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:11,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:11,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:11,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:11,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:11,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:11,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:11,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:11,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:11,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:11,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:11,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:11,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:11,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:11,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:11,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:11,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:11,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:11,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:11,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:11,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:11,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:11,542 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 19:16:11,542 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:11,542 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:11,542 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:11,542 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-12-01 19:16:11,542 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:11,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 19:16:11,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 19:16:11,578 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. [2018-12-01 19:16:11,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-12-01 19:16:11,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 19:16:11,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,579 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,597 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 [2018-12-01 19:16:11,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 19:16:11,616 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. [2018-12-01 19:16:11,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:11,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 19:16:11,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,617 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,640 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 [2018-12-01 19:16:11,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-01 19:16:11,645 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. [2018-12-01 19:16:11,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:16:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-12-01 19:16:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 19:16:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-12-01 19:16:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-12-01 19:16:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-12-01 19:16:11,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 19:16:11,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2018-12-01 19:16:11,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-01 19:16:11,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-01 19:16:11,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-12-01 19:16:11,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:11,648 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-12-01 19:16:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-12-01 19:16:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2018-12-01 19:16:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-01 19:16:11,648 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-12-01 19:16:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:16:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:16:11,651 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-12-01 19:16:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:16:11,662 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-01 19:16:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:16:11,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-12-01 19:16:11,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 19:16:11,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2018-12-01 19:16:11,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-01 19:16:11,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-01 19:16:11,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-12-01 19:16:11,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:11,664 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-01 19:16:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-12-01 19:16:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-01 19:16:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-01 19:16:11,665 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-01 19:16:11,665 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-01 19:16:11,665 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 19:16:11,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-01 19:16:11,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 19:16:11,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:11,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:11,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2018-12-01 19:16:11,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-12-01 19:16:11,666 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 [2018-12-01 19:16:11,666 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 [2018-12-01 19:16:11,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2018-12-01 19:16:11,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-12-01 19:16:11,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:11,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2018-12-01 19:16:11,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:11,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:11,713 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:11,713 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:11,713 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:11,713 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:11,713 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:11,713 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:11,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:11,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:11,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-12-01 19:16:11,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:11,714 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:11,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:11,747 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:11,749 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:11,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:11,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:11,768 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:11,784 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:11,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:11,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:11,785 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:11,785 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:11,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:11,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:11,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:11,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-12-01 19:16:11,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:11,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:11,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:11,821 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:11,821 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:11,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:11,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:11,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:11,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:11,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:11,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:11,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:11,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:11,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:11,826 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:11,826 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 19:16:11,826 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:11,826 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:11,826 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:11,826 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2018-12-01 19:16:11,826 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:11,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,859 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 19:16:11,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 19:16:11,863 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. [2018-12-01 19:16:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 19:16:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-12-01 19:16:11,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 19:16:11,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,864 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 19:16:11,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 19:16:11,910 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. [2018-12-01 19:16:11,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 19:16:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:11,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 19:16:11,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,911 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,938 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 19:16:11,938 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 19:16:11,942 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. [2018-12-01 19:16:11,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 19:16:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-12-01 19:16:11,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 19:16:11,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,943 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:11,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:11,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:11,970 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 [2018-12-01 19:16:11,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 19:16:11,980 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. [2018-12-01 19:16:11,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 19:16:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 19:16:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 19:16:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:11,981 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:12,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:12,024 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 [2018-12-01 19:16:12,025 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 19:16:12,060 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 [2018-12-01 19:16:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 19:16:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-12-01 19:16:12,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 19:16:12,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-01 19:16:12,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-01 19:16:12,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-12-01 19:16:12,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-01 19:16:12,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2018-12-01 19:16:12,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-01 19:16:12,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-12-01 19:16:12,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2018-12-01 19:16:12,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:12,066 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2018-12-01 19:16:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2018-12-01 19:16:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-12-01 19:16:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 19:16:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-12-01 19:16:12,069 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-12-01 19:16:12,069 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-12-01 19:16:12,069 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 19:16:12,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-12-01 19:16:12,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 19:16:12,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:12,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:12,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2018-12-01 19:16:12,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-12-01 19:16:12,070 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 [2018-12-01 19:16:12,070 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 [2018-12-01 19:16:12,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2018-12-01 19:16:12,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 19:16:12,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:16:12,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-01 19:16:12,097 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-01 19:16:12,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:16:12,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 19:16:12,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:16:12,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-12-01 19:16:12,124 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 19:16:12,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2018-12-01 19:16:12,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,160 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:12,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:12,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:12,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:12,160 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:12,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:12,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:12,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:12,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-12-01 19:16:12,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:12,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:12,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:12,196 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:12,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:12,213 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:12,213 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:12,216 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:12,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:12,297 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:12,298 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:12,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:12,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:12,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:12,299 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:12,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:12,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:12,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:12,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-12-01 19:16:12,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:12,299 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:12,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,333 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:12,333 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:12,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:12,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:12,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:12,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:12,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:12,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:12,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:12,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:12,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:12,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:12,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:12,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:12,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:12,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:12,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:12,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:12,338 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:12,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:12,339 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:12,340 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:12,340 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:12,340 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:12,340 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:12,340 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:12,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:12,373 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 [2018-12-01 19:16:12,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-01 19:16:12,388 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. [2018-12-01 19:16:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 19:16:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-01 19:16:12,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-01 19:16:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 19:16:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2018-12-01 19:16:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2018-12-01 19:16:12,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 19:16:12,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2018-12-01 19:16:12,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-01 19:16:12,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-12-01 19:16:12,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2018-12-01 19:16:12,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:12,391 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2018-12-01 19:16:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2018-12-01 19:16:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-12-01 19:16:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-01 19:16:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2018-12-01 19:16:12,395 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2018-12-01 19:16:12,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:16:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:16:12,395 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2018-12-01 19:16:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:16:12,404 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-01 19:16:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:16:12,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2018-12-01 19:16:12,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 19:16:12,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2018-12-01 19:16:12,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-01 19:16:12,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-12-01 19:16:12,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2018-12-01 19:16:12,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:12,405 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-01 19:16:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2018-12-01 19:16:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-01 19:16:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-01 19:16:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-12-01 19:16:12,407 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-01 19:16:12,407 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-01 19:16:12,407 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 19:16:12,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-12-01 19:16:12,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-01 19:16:12,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:12,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:12,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2018-12-01 19:16:12,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-12-01 19:16:12,408 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 [2018-12-01 19:16:12,408 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 [2018-12-01 19:16:12,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2018-12-01 19:16:12,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2018-12-01 19:16:12,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2018-12-01 19:16:12,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 19:16:12,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:16:12,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 19:16:12,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:16:12,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-01 19:16:12,510 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:12,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:12,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:12,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:12,510 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:12,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:12,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:12,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:12,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-12-01 19:16:12,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:12,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:12,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:12,544 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,548 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:12,548 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:12,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:12,562 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:12,566 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:12,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:12,635 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:12,636 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:12,636 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:12,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:12,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:12,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:12,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:12,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:12,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:12,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-12-01 19:16:12,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:12,637 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:12,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:12,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:12,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:12,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:12,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:12,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:12,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:12,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:12,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:12,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:12,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:12,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:12,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:12,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:12,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:12,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:12,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:12,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:12,686 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:12,687 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:12,687 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:12,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:12,688 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:12,688 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:12,688 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:12,688 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:12,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:12,725 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 [2018-12-01 19:16:12,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-01 19:16:12,737 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. [2018-12-01 19:16:12,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 19:16:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-01 19:16:12,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-01 19:16:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,738 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:12,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:12,783 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 [2018-12-01 19:16:12,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-01 19:16:12,793 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. [2018-12-01 19:16:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 19:16:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-12-01 19:16:12,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-01 19:16:12,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,793 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:12,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:12,818 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 [2018-12-01 19:16:12,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-01 19:16:12,836 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. [2018-12-01 19:16:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 19:16:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-01 19:16:12,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-01 19:16:12,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2018-12-01 19:16:12,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2018-12-01 19:16:12,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:12,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2018-12-01 19:16:12,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-12-01 19:16:12,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2018-12-01 19:16:12,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-12-01 19:16:12,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-12-01 19:16:12,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2018-12-01 19:16:12,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:12,839 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-12-01 19:16:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2018-12-01 19:16:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-12-01 19:16:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 19:16:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-12-01 19:16:12,841 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-12-01 19:16:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:16:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:16:12,842 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2018-12-01 19:16:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:16:12,853 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2018-12-01 19:16:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:16:12,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-12-01 19:16:12,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-12-01 19:16:12,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2018-12-01 19:16:12,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-12-01 19:16:12,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 19:16:12,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2018-12-01 19:16:12,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:12,854 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2018-12-01 19:16:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2018-12-01 19:16:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-12-01 19:16:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 19:16:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-01 19:16:12,856 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-01 19:16:12,856 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-01 19:16:12,856 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 19:16:12,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-12-01 19:16:12,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-01 19:16:12,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:12,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:12,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:12,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2018-12-01 19:16:12,856 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 [2018-12-01 19:16:12,856 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 [2018-12-01 19:16:12,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,857 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2018-12-01 19:16:12,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2018-12-01 19:16:12,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 19:16:12,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:16:12,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:16:12,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 19:16:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:16:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:16:12,874 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-01 19:16:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:16:12,880 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-12-01 19:16:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:16:12,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2018-12-01 19:16:12,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 19:16:12,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2018-12-01 19:16:12,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 19:16:12,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 19:16:12,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-12-01 19:16:12,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:12,881 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-01 19:16:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-12-01 19:16:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-12-01 19:16:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 19:16:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-01 19:16:12,882 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-01 19:16:12,882 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-01 19:16:12,882 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 19:16:12,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2018-12-01 19:16:12,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-01 19:16:12,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:12,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:12,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:12,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2018-12-01 19:16:12,883 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 [2018-12-01 19:16:12,883 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 [2018-12-01 19:16:12,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2018-12-01 19:16:12,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2018-12-01 19:16:12,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2018-12-01 19:16:12,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:12,943 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:12,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:12,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:12,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:12,943 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:12,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:12,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:12,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:12,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-12-01 19:16:12,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:12,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:12,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:12,973 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:12,973 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:12,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:12,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:12,998 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:12,998 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:13,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:13,001 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:13,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:13,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:13,020 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:13,033 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:13,033 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:13,033 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:13,033 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:13,033 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:13,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:13,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:13,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:13,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-12-01 19:16:13,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:13,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:13,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,066 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:13,066 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:13,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:13,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:13,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:13,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:13,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:13,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:13,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:13,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:13,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:13,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:13,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:13,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:13,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:13,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:13,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:13,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:13,070 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:13,071 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:13,071 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:13,071 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:13,071 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:13,071 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:13,071 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:13,072 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:13,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,114 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 [2018-12-01 19:16:13,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-01 19:16:13,117 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. [2018-12-01 19:16:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:13,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 19:16:13,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,118 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,161 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 [2018-12-01 19:16:13,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-01 19:16:13,163 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. [2018-12-01 19:16:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:13,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 19:16:13,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,164 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,206 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 19:16:13,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-01 19:16:13,210 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. [2018-12-01 19:16:13,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 19:16:13,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 19:16:13,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,211 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,246 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 [2018-12-01 19:16:13,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-01 19:16:13,262 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. [2018-12-01 19:16:13,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-01 19:16:13,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 19:16:13,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,262 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,296 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 [2018-12-01 19:16:13,296 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-01 19:16:13,320 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,321 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,321 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,321 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,322 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,343 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,343 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,343 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,343 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,343 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,343 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,344 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,344 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,348 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 [2018-12-01 19:16:13,348 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 [2018-12-01 19:16:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-01 19:16:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-12-01 19:16:13,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-12-01 19:16:13,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-12-01 19:16:13,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-12-01 19:16:13,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2018-12-01 19:16:13,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-12-01 19:16:13,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2018-12-01 19:16:13,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-12-01 19:16:13,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-01 19:16:13,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2018-12-01 19:16:13,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:13,356 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2018-12-01 19:16:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2018-12-01 19:16:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-12-01 19:16:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-01 19:16:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2018-12-01 19:16:13,360 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-12-01 19:16:13,360 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-12-01 19:16:13,360 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 19:16:13,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2018-12-01 19:16:13,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-01 19:16:13,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:13,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:13,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:13,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2018-12-01 19:16:13,361 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 [2018-12-01 19:16:13,361 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 [2018-12-01 19:16:13,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2018-12-01 19:16:13,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:13,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:13,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:13,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:13,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2018-12-01 19:16:13,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:13,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:13,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2018-12-01 19:16:13,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:13,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:13,449 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:13,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:13,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:13,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:13,450 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:13,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:13,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:13,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:13,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2018-12-01 19:16:13,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:13,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:13,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:13,478 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:13,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:13,481 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:13,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:13,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:13,499 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:13,512 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:13,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:13,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:13,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:13,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:13,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:13,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:13,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:13,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2018-12-01 19:16:13,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:13,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:13,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:13,548 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:13,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:13,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:13,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:13,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:13,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:13,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:13,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:13,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:13,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:13,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:13,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:13,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:13,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:13,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:13,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:13,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:13,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:13,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:13,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:13,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:13,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:13,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:13,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:13,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:13,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:13,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:13,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:13,555 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:13,555 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:13,555 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:13,555 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:13,555 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:13,556 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:13,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,622 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 [2018-12-01 19:16:13,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-01 19:16:13,625 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. [2018-12-01 19:16:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 19:16:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-01 19:16:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,626 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,695 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 [2018-12-01 19:16:13,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-01 19:16:13,698 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. [2018-12-01 19:16:13,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 19:16:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:13,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-01 19:16:13,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,698 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,746 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 [2018-12-01 19:16:13,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-01 19:16:13,751 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. [2018-12-01 19:16:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 19:16:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 19:16:13,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-01 19:16:13,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,751 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,796 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 [2018-12-01 19:16:13,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-01 19:16:13,821 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. [2018-12-01 19:16:13,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 19:16:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-01 19:16:13,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-01 19:16:13,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:13,822 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:13,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:13,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:13,876 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 [2018-12-01 19:16:13,877 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-12-01 19:16:13,905 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,905 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,906 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,906 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,906 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,907 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,907 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,907 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,908 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,938 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,939 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,939 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,940 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,941 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,942 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,942 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,943 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,943 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,943 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,982 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,982 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,982 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,982 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,983 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,983 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,984 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,985 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,985 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,985 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,985 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,985 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,986 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,987 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,987 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,987 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,987 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,987 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,988 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:13,988 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,001 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 [2018-12-01 19:16:14,001 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 [2018-12-01 19:16:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-01 19:16:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-12-01 19:16:14,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2018-12-01 19:16:14,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2018-12-01 19:16:14,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2018-12-01 19:16:14,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2018-12-01 19:16:14,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-01 19:16:14,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2018-12-01 19:16:14,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-01 19:16:14,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 19:16:14,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2018-12-01 19:16:14,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:14,016 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2018-12-01 19:16:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2018-12-01 19:16:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2018-12-01 19:16:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-01 19:16:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2018-12-01 19:16:14,024 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-12-01 19:16:14,024 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-12-01 19:16:14,024 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-01 19:16:14,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2018-12-01 19:16:14,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-01 19:16:14,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:14,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:14,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:14,026 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2018-12-01 19:16:14,026 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 [2018-12-01 19:16:14,026 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 [2018-12-01 19:16:14,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2018-12-01 19:16:14,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:14,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2018-12-01 19:16:14,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:14,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2018-12-01 19:16:14,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:16:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,132 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:14,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:14,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:14,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:14,132 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:14,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:14,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:14,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:14,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2018-12-01 19:16:14,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:14,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:14,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,162 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:14,162 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:14,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:14,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:14,189 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:14,189 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:14,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:14,192 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:14,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:14,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:14,227 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:14,228 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:14,228 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:14,228 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:14,228 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:14,228 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:14,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:14,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:14,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:14,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2018-12-01 19:16:14,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:14,229 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:14,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:14,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:14,265 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:14,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:14,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:14,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:14,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:14,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:14,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:14,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:14,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:14,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:14,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:14,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:14,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:14,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:14,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:14,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:14,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:14,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:14,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:14,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:14,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:14,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:14,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:14,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:14,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:14,270 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:14,271 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:14,271 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:14,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:14,271 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:14,271 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:14,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:14,271 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:14,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:14,341 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 [2018-12-01 19:16:14,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-12-01 19:16:14,344 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. [2018-12-01 19:16:14,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 19:16:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:14,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-01 19:16:14,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,345 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:14,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:14,409 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 [2018-12-01 19:16:14,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-12-01 19:16:14,413 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. [2018-12-01 19:16:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 19:16:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:14,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-01 19:16:14,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,413 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:14,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:14,483 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 [2018-12-01 19:16:14,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-12-01 19:16:14,488 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. [2018-12-01 19:16:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 19:16:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 19:16:14,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-01 19:16:14,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,488 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:14,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:14,561 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 [2018-12-01 19:16:14,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-12-01 19:16:14,580 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. [2018-12-01 19:16:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 19:16:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-01 19:16:14,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-01 19:16:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,581 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:14,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:14,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:14,644 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 [2018-12-01 19:16:14,644 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-12-01 19:16:14,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,689 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,690 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,690 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,690 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,690 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,690 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,690 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,691 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,692 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,692 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,692 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,738 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,739 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,769 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,770 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,771 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,772 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,772 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,772 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,772 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,772 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,777 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,778 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,778 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,778 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,778 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,778 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,779 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,820 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,821 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,821 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,821 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,821 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,822 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,823 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,824 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,824 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,824 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,824 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,824 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,824 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,825 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,825 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,825 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,825 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,825 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,826 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,827 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,828 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:14,844 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 [2018-12-01 19:16:14,844 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 [2018-12-01 19:16:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 19:16:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2018-12-01 19:16:14,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2018-12-01 19:16:14,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2018-12-01 19:16:14,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2018-12-01 19:16:14,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:14,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2018-12-01 19:16:14,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-12-01 19:16:14,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2018-12-01 19:16:14,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 19:16:14,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 19:16:14,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2018-12-01 19:16:14,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:14,871 INFO L705 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2018-12-01 19:16:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2018-12-01 19:16:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2018-12-01 19:16:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-12-01 19:16:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2018-12-01 19:16:14,887 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2018-12-01 19:16:14,887 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2018-12-01 19:16:14,887 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-01 19:16:14,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2018-12-01 19:16:14,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-01 19:16:14,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:14,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:14,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:14,889 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2018-12-01 19:16:14,889 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 [2018-12-01 19:16:14,890 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 [2018-12-01 19:16:14,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,890 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2018-12-01 19:16:14,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:14,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:14,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2018-12-01 19:16:14,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:14,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:14,899 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2018-12-01 19:16:14,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:14,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:15,034 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-12-01 19:16:15,040 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:15,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:15,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:15,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:15,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:15,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:15,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:15,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:15,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2018-12-01 19:16:15,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:15,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:15,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,076 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:15,076 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:15,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:15,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:15,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:15,093 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:15,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:15,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:15,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 19:16:15,111 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 /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:15,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:15,114 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:15,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:15,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:15,155 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:15,156 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:15,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:15,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:15,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:15,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:15,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:15,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:15,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:15,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2018-12-01 19:16:15,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:15,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:15,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:15,200 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:15,200 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:15,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:15,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:15,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:15,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:15,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:15,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:15,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:15,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:15,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:15,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:15,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:15,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:15,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:15,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:15,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:15,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:15,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:15,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:15,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:15,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:15,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:15,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:15,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:15,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:15,208 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:15,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:15,209 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:15,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:15,209 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:15,210 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:15,210 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-12-01 19:16:15,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:15,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:15,309 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 [2018-12-01 19:16:15,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-12-01 19:16:15,314 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. [2018-12-01 19:16:15,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 19:16:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:15,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2018-12-01 19:16:15,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:15,314 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:15,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:15,398 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 [2018-12-01 19:16:15,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-12-01 19:16:15,402 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. [2018-12-01 19:16:15,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 19:16:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:15,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2018-12-01 19:16:15,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:15,402 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:15,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:15,486 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 [2018-12-01 19:16:15,486 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-12-01 19:16:15,491 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. [2018-12-01 19:16:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 19:16:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-01 19:16:15,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2018-12-01 19:16:15,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:15,492 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:15,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:15,568 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 [2018-12-01 19:16:15,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-12-01 19:16:15,590 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. [2018-12-01 19:16:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 19:16:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-12-01 19:16:15,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2018-12-01 19:16:15,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:15,591 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:15,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:15,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:16:15,677 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 [2018-12-01 19:16:15,678 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-12-01 19:16:15,729 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,729 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,730 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,730 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,730 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,730 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,730 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,730 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,731 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,732 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,733 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,734 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,735 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,736 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,737 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,773 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,774 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,775 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,776 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,783 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,783 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,784 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,785 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,785 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,785 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,785 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,785 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,786 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,787 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,788 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,789 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,790 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,830 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,830 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,830 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,830 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,831 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,832 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,834 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,835 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,835 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,835 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,835 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,835 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,835 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,836 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,837 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,838 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,839 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,840 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,841 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,842 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,843 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,844 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,845 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,846 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,847 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,848 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,849 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,850 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,909 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,910 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,911 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,911 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,911 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,911 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,911 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,912 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,913 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,913 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,914 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,915 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,916 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,917 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,918 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,919 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,920 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,920 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,920 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,920 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,920 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,921 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,922 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,923 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,924 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,925 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,926 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,926 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,926 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,926 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,991 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,991 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,991 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,991 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,991 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,991 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,992 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,994 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,995 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,995 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,995 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,995 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,995 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,996 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,997 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,998 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,998 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,998 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,998 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:15,999 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,000 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,000 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,001 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,002 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,003 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,004 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,005 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,006 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,007 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,007 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,008 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,009 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,009 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,009 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,009 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,010 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,010 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,010 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,010 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,011 WARN L278 uchiComplementFKVNwa]: big8 [2018-12-01 19:16:16,036 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 [2018-12-01 19:16:16,037 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 [2018-12-01 19:16:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 19:16:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2018-12-01 19:16:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2018-12-01 19:16:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2018-12-01 19:16:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2018-12-01 19:16:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2018-12-01 19:16:16,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-12-01 19:16:16,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2018-12-01 19:16:16,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-01 19:16:16,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 19:16:16,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2018-12-01 19:16:16,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 19:16:16,096 INFO L705 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2018-12-01 19:16:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2018-12-01 19:16:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2018-12-01 19:16:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-12-01 19:16:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2018-12-01 19:16:16,123 INFO L728 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2018-12-01 19:16:16,123 INFO L608 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2018-12-01 19:16:16,123 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-01 19:16:16,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2018-12-01 19:16:16,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-12-01 19:16:16,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:16:16,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:16:16,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-12-01 19:16:16,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2018-12-01 19:16:16,126 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 [2018-12-01 19:16:16,126 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 [2018-12-01 19:16:16,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2018-12-01 19:16:16,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:16,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:16,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:16,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2018-12-01 19:16:16,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:16,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:16,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:16,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2018-12-01 19:16:16,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:16:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:16:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:16,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:16:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:16:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:16:16,290 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2018-12-01 19:16:16,296 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:16,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:16,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:16,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:16,296 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:16:16,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:16,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:16,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:16,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2018-12-01 19:16:16,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:16,296 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:16,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,324 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:16,324 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:16,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:16:16,326 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a07a75eb-4a7f-4ad2-98cb-7e25d202b3ee/bin-2019/uautomizer/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 [2018-12-01 19:16:16,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:16:16,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:16:16,357 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:16:16,358 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:16:16,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:16:16,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:16:16,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:16:16,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:16:16,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:16:16,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:16:16,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:16:16,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2018-12-01 19:16:16,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:16:16,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:16:16,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:16:16,391 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:16:16,391 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:16:16,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:16,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:16,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:16,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:16,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:16,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:16:16,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:16:16,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:16:16,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 19:16:16,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:16:16,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:16:16,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:16:16,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:16:16,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:16:16,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:16:16,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:16:16,394 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:16:16,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:16:16,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 19:16:16,395 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:16:16,395 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:16:16,395 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:16:16,395 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-12-01 19:16:16,396 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:16:16,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 19:16:16,441 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 [2018-12-01 19:16:16,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-12-01 19:16:16,448 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. [2018-12-01 19:16:16,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 19:16:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:16,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2018-12-01 19:16:16,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,449 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:16,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 19:16:16,488 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 [2018-12-01 19:16:16,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-12-01 19:16:16,494 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. [2018-12-01 19:16:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 19:16:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-12-01 19:16:16,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2018-12-01 19:16:16,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:16,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 19:16:16,540 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 [2018-12-01 19:16:16,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-12-01 19:16:16,554 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. [2018-12-01 19:16:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 19:16:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 19:16:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-01 19:16:16,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2018-12-01 19:16:16,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,555 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 19:16:16,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:16:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:16:16,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:16:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 19:16:16,593 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 [2018-12-01 19:16:16,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-12-01 19:16:16,617 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. [2018-12-01 19:16:16,618 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 [2018-12-01 19:16:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 19:16:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-12-01 19:16:16,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2018-12-01 19:16:16,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2018-12-01 19:16:16,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2018-12-01 19:16:16,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:16:16,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2018-12-01 19:16:16,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:16:16,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2018-12-01 19:16:16,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 19:16:16,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 19:16:16,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 19:16:16,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:16:16,628 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:16:16,628 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:16:16,628 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:16:16,628 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-01 19:16:16,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:16:16,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:16:16,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 19:16:16,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 07:16:16 BoogieIcfgContainer [2018-12-01 19:16:16,634 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 19:16:16,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:16:16,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:16:16,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:16:16,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:16:10" (3/4) ... [2018-12-01 19:16:16,638 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 19:16:16,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:16:16,639 INFO L168 Benchmark]: Toolchain (without parser) took 6891.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 953.3 MB in the beginning and 1.2 GB in the end (delta: -267.6 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-12-01 19:16:16,639 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:16:16,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:16:16,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.93 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:16:16,640 INFO L168 Benchmark]: Boogie Preprocessor took 11.48 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:16:16,640 INFO L168 Benchmark]: RCFGBuilder took 135.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-01 19:16:16,641 INFO L168 Benchmark]: BuchiAutomizer took 6591.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.3 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:16:16,641 INFO L168 Benchmark]: Witness Printer took 3.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:16:16,643 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.93 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.48 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 135.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6591.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.3 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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 6.5s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 3169 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.1s 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, 0.2s 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: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...