./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82151ec4435da78821025b3100fe51201edc8f02 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:51:41,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:51:41,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:51:41,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:51:41,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:51:41,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:51:41,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:51:41,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:51:41,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:51:41,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:51:41,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:51:41,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:51:41,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:51:41,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:51:41,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:51:41,710 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:51:41,711 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:51:41,712 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:51:41,713 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:51:41,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:51:41,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:51:41,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:51:41,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:51:41,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:51:41,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:51:41,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:51:41,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:51:41,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:51:41,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:51:41,721 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:51:41,721 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:51:41,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:51:41,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:51:41,722 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:51:41,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:51:41,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:51:41,723 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:51:41,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:51:41,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:51:41,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:51:41,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:51:41,733 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:51:41,733 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:51:41,733 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:51:41,733 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:51:41,733 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:51:41,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:51:41,734 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:51:41,735 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:51:41,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:51:41,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:51:41,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:51:41,736 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:51:41,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:51:41,736 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:51:41,736 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:51:41,737 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:51:41,737 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_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82151ec4435da78821025b3100fe51201edc8f02 [2018-11-18 10:51:41,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:51:41,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:51:41,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:51:41,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:51:41,773 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:51:41,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-18 10:51:41,823 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/data/14e6c592c/16fd937e3f4a47d0a67ae007440c4773/FLAGe6634d23b [2018-11-18 10:51:42,162 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:51:42,163 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-18 10:51:42,169 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/data/14e6c592c/16fd937e3f4a47d0a67ae007440c4773/FLAGe6634d23b [2018-11-18 10:51:42,579 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/data/14e6c592c/16fd937e3f4a47d0a67ae007440c4773 [2018-11-18 10:51:42,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:51:42,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:51:42,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:51:42,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:51:42,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:51:42,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0c3510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42, skipping insertion in model container [2018-11-18 10:51:42,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:51:42,612 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:51:42,718 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:51:42,721 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:51:42,733 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:51:42,744 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:51:42,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42 WrapperNode [2018-11-18 10:51:42,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:51:42,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:51:42,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:51:42,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:51:42,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:51:42,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:51:42,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:51:42,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:51:42,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... [2018-11-18 10:51:42,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:51:42,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:51:42,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:51:42,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:51:42,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2018-11-18 10:51:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2018-11-18 10:51:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-18 10:51:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-18 10:51:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:51:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:51:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2018-11-18 10:51:42,860 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2018-11-18 10:51:43,044 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:51:43,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:51:43 BoogieIcfgContainer [2018-11-18 10:51:43,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:51:43,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:51:43,045 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:51:43,049 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:51:43,050 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:51:43,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:51:42" (1/3) ... [2018-11-18 10:51:43,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a4ae0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:51:43, skipping insertion in model container [2018-11-18 10:51:43,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:51:43,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:51:42" (2/3) ... [2018-11-18 10:51:43,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a4ae0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:51:43, skipping insertion in model container [2018-11-18 10:51:43,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:51:43,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:51:43" (3/3) ... [2018-11-18 10:51:43,053 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-18 10:51:43,103 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:51:43,104 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:51:43,104 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:51:43,104 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:51:43,104 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:51:43,104 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:51:43,104 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:51:43,104 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:51:43,104 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:51:43,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-18 10:51:43,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-18 10:51:43,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:43,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:43,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:51:43,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:43,147 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:51:43,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-18 10:51:43,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-18 10:51:43,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:43,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:43,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:51:43,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:43,156 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 14#L76true assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 10#L51true call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 12#is_prime_ENTRYtrue [2018-11-18 10:51:43,157 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 42#L56true assume !(~n <= 1); 36#L59true assume !(2 == ~n); 26#L62true assume ~n > 2; 40#L63true assume !(~m <= 1); 33#L66true call #t~ret6 := multiple_of(~n, ~m);< 52#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 32#L30true assume !(~m < 0); 25#L33true assume !(~n < 0); 38#L36true assume 0 == ~m;#res := 0; 28#multiple_ofFINALtrue assume true; 47#multiple_ofEXITtrue >#122#return; 31#L66-1true assume !(0 == #t~ret6);havoc #t~ret6; 24#L69true call #t~ret7 := is_prime_(~n, ~m - 1);< 12#is_prime_ENTRYtrue [2018-11-18 10:51:43,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 1 times [2018-11-18 10:51:43,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1788949215, now seen corresponding path program 1 times [2018-11-18 10:51:43,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:43,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:43,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:51:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:51:43,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:51:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:51:43,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:51:43,310 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-11-18 10:51:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:43,422 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2018-11-18 10:51:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:51:43,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 80 transitions. [2018-11-18 10:51:43,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-18 10:51:43,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 41 states and 54 transitions. [2018-11-18 10:51:43,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-18 10:51:43,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 10:51:43,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2018-11-18 10:51:43,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:51:43,439 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 10:51:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2018-11-18 10:51:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-18 10:51:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 10:51:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-11-18 10:51:43,462 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-11-18 10:51:43,462 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-11-18 10:51:43,463 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:51:43,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2018-11-18 10:51:43,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-18 10:51:43,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:43,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:43,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:51:43,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:43,465 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 145#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 134#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 142#is_prime_ENTRY [2018-11-18 10:51:43,465 INFO L796 eck$LassoCheckResult]: Loop: 142#is_prime_ENTRY ~n := #in~n;~m := #in~m; 143#L56 assume !(~n <= 1); 133#L59 assume !(2 == ~n); 137#L62 assume ~n > 2; 146#L63 assume !(~m <= 1); 122#L66 call #t~ret6 := multiple_of(~n, ~m);< 130#multiple_ofENTRY ~n := #in~n;~m := #in~m; 156#L30 assume !(~m < 0); 152#L33 assume !(~n < 0); 140#L36 assume !(0 == ~m); 141#L39 assume 0 == ~n;#res := 1; 124#multiple_ofFINAL assume true; 153#multiple_ofEXIT >#122#return; 154#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 135#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 142#is_prime_ENTRY [2018-11-18 10:51:43,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 2 times [2018-11-18 10:51:43,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash 399153633, now seen corresponding path program 1 times [2018-11-18 10:51:43,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:43,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:51:43,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:51:43,508 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:51:43,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:51:43,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:51:43,508 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 10:51:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:43,582 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2018-11-18 10:51:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:51:43,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-18 10:51:43,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-18 10:51:43,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 57 transitions. [2018-11-18 10:51:43,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-18 10:51:43,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-18 10:51:43,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2018-11-18 10:51:43,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:51:43,589 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2018-11-18 10:51:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2018-11-18 10:51:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-18 10:51:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 10:51:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-18 10:51:43,593 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 10:51:43,594 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 10:51:43,594 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:51:43,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-18 10:51:43,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-18 10:51:43,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:43,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:43,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:51:43,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:43,596 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 237#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 226#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 234#is_prime_ENTRY [2018-11-18 10:51:43,597 INFO L796 eck$LassoCheckResult]: Loop: 234#is_prime_ENTRY ~n := #in~n;~m := #in~m; 235#L56 assume !(~n <= 1); 225#L59 assume !(2 == ~n); 229#L62 assume ~n > 2; 238#L63 assume !(~m <= 1); 214#L66 call #t~ret6 := multiple_of(~n, ~m);< 222#multiple_ofENTRY ~n := #in~n;~m := #in~m; 250#L30 assume !(~m < 0); 245#L33 assume !(~n < 0); 232#L36 assume !(0 == ~m); 233#L39 assume !(0 == ~n); 215#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 222#multiple_ofENTRY ~n := #in~n;~m := #in~m; 250#L30 assume !(~m < 0); 245#L33 assume !(~n < 0); 232#L36 assume !(0 == ~m); 233#L39 assume 0 == ~n;#res := 1; 216#multiple_ofFINAL assume true; 246#multiple_ofEXIT >#112#return; 239#L42-1 #res := #t~ret4;havoc #t~ret4; 240#multiple_ofFINAL assume true; 247#multiple_ofEXIT >#122#return; 249#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 227#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 234#is_prime_ENTRY [2018-11-18 10:51:43,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 3 times [2018-11-18 10:51:43,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:43,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1840266607, now seen corresponding path program 1 times [2018-11-18 10:51:43,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:43,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1482001207, now seen corresponding path program 1 times [2018-11-18 10:51:43,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:43,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 10:51:43,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:51:43,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:51:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:43,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 10:51:43,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:51:43,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 10:51:44,075 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:44,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:44,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:44,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:44,076 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:44,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:44,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:44,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:44,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-18 10:51:44,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:44,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:44,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:44,134 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:44,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:44,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:44,160 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:44,160 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:44,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:44,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:44,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:44,180 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:44,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:44,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:44,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:44,198 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret6=0} Honda state: {is_prime__#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:44,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:44,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:44,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:44,216 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret7=0} Honda state: {is_prime__#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:44,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:44,240 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:44,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:44,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:44,294 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:44,295 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:44,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:44,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:44,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:44,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:44,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:44,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:44,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:44,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-18 10:51:44,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:44,296 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:44,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-11-18 10:51:44,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:44,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:44,387 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:44,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:44,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:44,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:44,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:44,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:44,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:44,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:44,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:44,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:44,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:44,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:44,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:44,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:44,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:44,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:44,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:44,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:44,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:44,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:44,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:44,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:44,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:44,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:44,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:44,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:44,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:44,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:44,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:44,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:44,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:44,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:44,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:44,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:44,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:44,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:44,407 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:44,415 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 10:51:44,415 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:51:44,417 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:44,417 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:44,417 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:44,417 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2018-11-18 10:51:44,418 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:44,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:44,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:44,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 10:51:44,596 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-11-18 10:51:44,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-18 10:51:44,892 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 175 states and 239 transitions. Complement of second has 40 states. [2018-11-18 10:51:44,893 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-11-18 10:51:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 10:51:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2018-11-18 10:51:44,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2018-11-18 10:51:44,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:44,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 28 letters. Loop has 24 letters. [2018-11-18 10:51:44,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:44,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 4 letters. Loop has 48 letters. [2018-11-18 10:51:44,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:44,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 239 transitions. [2018-11-18 10:51:44,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-18 10:51:44,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 151 states and 201 transitions. [2018-11-18 10:51:44,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-18 10:51:44,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-18 10:51:44,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 201 transitions. [2018-11-18 10:51:44,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:44,908 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 201 transitions. [2018-11-18 10:51:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 201 transitions. [2018-11-18 10:51:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2018-11-18 10:51:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 10:51:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-18 10:51:44,918 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-18 10:51:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:51:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:51:44,918 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 9 states. [2018-11-18 10:51:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:45,062 INFO L93 Difference]: Finished difference Result 146 states and 193 transitions. [2018-11-18 10:51:45,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:51:45,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 193 transitions. [2018-11-18 10:51:45,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-18 10:51:45,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 140 states and 185 transitions. [2018-11-18 10:51:45,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-18 10:51:45,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-18 10:51:45,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 185 transitions. [2018-11-18 10:51:45,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:45,068 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2018-11-18 10:51:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 185 transitions. [2018-11-18 10:51:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2018-11-18 10:51:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 10:51:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2018-11-18 10:51:45,075 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 145 transitions. [2018-11-18 10:51:45,075 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 145 transitions. [2018-11-18 10:51:45,075 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:51:45,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 145 transitions. [2018-11-18 10:51:45,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-18 10:51:45,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:45,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:45,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:45,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:51:45,077 INFO L794 eck$LassoCheckResult]: Stem: 1001#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 980#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 981#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 959#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 975#is_prime_ENTRY ~n := #in~n;~m := #in~m; 977#L56 assume !(~n <= 1); 958#L59 assume !(2 == ~n); 961#L62 assume ~n > 2; 982#L63 assume !(~m <= 1); 950#L66 call #t~ret6 := multiple_of(~n, ~m);< 1009#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1036#L30 assume ~m < 0; 969#L31 [2018-11-18 10:51:45,077 INFO L796 eck$LassoCheckResult]: Loop: 969#L31 call #t~ret2 := multiple_of(~n, -~m);< 988#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1006#L30 assume ~m < 0; 969#L31 [2018-11-18 10:51:45,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -123397399, now seen corresponding path program 1 times [2018-11-18 10:51:45,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:45,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:45,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:45,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:51:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:51:45,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:45,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 132621, now seen corresponding path program 1 times [2018-11-18 10:51:45,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:45,130 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:45,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:45,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:45,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:45,130 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:45,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:45,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:45,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:45,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-18 10:51:45,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:45,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:45,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,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-11-18 10:51:45,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,164 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:45,164 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:45,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:45,166 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:45,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:45,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret4=0} Honda state: {multiple_of_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:45,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:45,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:45,188 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:45,188 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=4, multiple_of_#in~n=4} Honda state: {multiple_of_~n=4, multiple_of_#in~n=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:45,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:45,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:45,215 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:45,216 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:45,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:45,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:45,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:45,234 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:45,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:45,250 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:45,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:45,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:45,854 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:45,856 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:45,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:45,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:45,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:45,856 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:45,856 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:45,856 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:45,856 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:45,856 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-18 10:51:45,856 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:45,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:45,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:45,886 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:45,886 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:45,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:45,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:45,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:45,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:45,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:45,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:45,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:45,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:45,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:45,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:45,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:45,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:45,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:45,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:45,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:45,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:45,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:45,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:45,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:45,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:45,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:45,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:45,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:45,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:45,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:45,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:45,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:45,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:45,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:45,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:45,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:45,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:45,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:45,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:45,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:45,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:45,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:45,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:45,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:45,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:45,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:45,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:45,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:45,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:45,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:45,900 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-18 10:51:45,900 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:51:45,901 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:45,901 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:45,901 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:45,901 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2018-11-18 10:51:45,901 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:45,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:45,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:45,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:45,940 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:51:45,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 145 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-18 10:51:45,986 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 145 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 210 states and 272 transitions. Complement of second has 18 states. [2018-11-18 10:51:45,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:51:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:51:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-18 10:51:45,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 10:51:45,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:45,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 10:51:45,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:45,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 10:51:45,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:45,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 272 transitions. [2018-11-18 10:51:45,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2018-11-18 10:51:45,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 156 states and 201 transitions. [2018-11-18 10:51:45,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2018-11-18 10:51:45,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-18 10:51:45,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 201 transitions. [2018-11-18 10:51:45,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:45,999 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 201 transitions. [2018-11-18 10:51:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 201 transitions. [2018-11-18 10:51:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 127. [2018-11-18 10:51:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 10:51:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2018-11-18 10:51:46,005 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 165 transitions. [2018-11-18 10:51:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:51:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:51:46,006 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand 5 states. [2018-11-18 10:51:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:46,045 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2018-11-18 10:51:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:51:46,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2018-11-18 10:51:46,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 10:51:46,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 145 transitions. [2018-11-18 10:51:46,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-18 10:51:46,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-11-18 10:51:46,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 145 transitions. [2018-11-18 10:51:46,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:46,050 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 145 transitions. [2018-11-18 10:51:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 145 transitions. [2018-11-18 10:51:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-11-18 10:51:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 10:51:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2018-11-18 10:51:46,054 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2018-11-18 10:51:46,054 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2018-11-18 10:51:46,054 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:51:46,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 141 transitions. [2018-11-18 10:51:46,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 10:51:46,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:46,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:46,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:46,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:51:46,056 INFO L794 eck$LassoCheckResult]: Stem: 1650#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1627#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 1628#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 1611#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1622#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1624#L56 assume ~n <= 1;#res := 0; 1684#is_prime_FINAL assume true; 1660#is_prime_EXIT >#118#return; 1614#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1604#L51-2 main_#t~ret9 := is_prime_#res;assume { :end_inline_is_prime } true;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 1605#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1640#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 1641#L95 assume main_#t~short13; 1596#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1613#multENTRY [2018-11-18 10:51:46,056 INFO L796 eck$LassoCheckResult]: Loop: 1613#multENTRY ~n := #in~n;~m := #in~m; 1594#L16 assume ~m < 0; 1597#L17 call #t~ret0 := mult(~n, -~m);< 1613#multENTRY [2018-11-18 10:51:46,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash 636635474, now seen corresponding path program 1 times [2018-11-18 10:51:46,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:46,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:46,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:46,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:46,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:51:46,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:51:46,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:46,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash 53805, now seen corresponding path program 1 times [2018-11-18 10:51:46,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:46,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:46,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:46,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:46,142 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:46,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:46,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:46,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:46,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:46,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:46,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:46,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:46,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-18 10:51:46,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:46,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:46,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:46,182 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,186 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,201 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,201 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,203 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,203 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,220 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,220 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,236 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,237 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,237 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,255 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,277 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,277 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,292 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:46,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,337 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:46,338 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:46,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:46,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:46,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:46,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:46,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:46,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:46,339 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:46,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-18 10:51:46,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:46,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:46,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:46,390 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:46,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,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-11-18 10:51:46,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:46,406 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-18 10:51:46,407 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:51:46,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:46,407 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:46,407 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:46,407 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2018-11-18 10:51:46,407 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:46,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:46,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:46,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:46,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:51:46,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 141 transitions. cyclomatic complexity: 34 Second operand 5 states. [2018-11-18 10:51:46,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 141 transitions. cyclomatic complexity: 34. Second operand 5 states. Result 143 states and 177 transitions. Complement of second has 14 states. [2018-11-18 10:51:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:51:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:51:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-18 10:51:46,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 10:51:46,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:46,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-18 10:51:46,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:46,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-18 10:51:46,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:46,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 177 transitions. [2018-11-18 10:51:46,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 10:51:46,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 135 states and 169 transitions. [2018-11-18 10:51:46,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-18 10:51:46,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-18 10:51:46,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 169 transitions. [2018-11-18 10:51:46,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:46,619 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 169 transitions. [2018-11-18 10:51:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 169 transitions. [2018-11-18 10:51:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2018-11-18 10:51:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 10:51:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2018-11-18 10:51:46,624 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 155 transitions. [2018-11-18 10:51:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:51:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:51:46,624 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand 7 states. [2018-11-18 10:51:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:46,670 INFO L93 Difference]: Finished difference Result 131 states and 164 transitions. [2018-11-18 10:51:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:51:46,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 164 transitions. [2018-11-18 10:51:46,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 10:51:46,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 123 states and 155 transitions. [2018-11-18 10:51:46,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 10:51:46,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 10:51:46,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 155 transitions. [2018-11-18 10:51:46,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:46,673 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 155 transitions. [2018-11-18 10:51:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 155 transitions. [2018-11-18 10:51:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-18 10:51:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 10:51:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2018-11-18 10:51:46,678 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 152 transitions. [2018-11-18 10:51:46,678 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 152 transitions. [2018-11-18 10:51:46,678 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:51:46,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 152 transitions. [2018-11-18 10:51:46,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 10:51:46,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:46,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:46,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:46,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:51:46,679 INFO L794 eck$LassoCheckResult]: Stem: 2255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 2231#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 2213#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2223#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2225#L56 assume !(~n <= 1); 2268#L59 assume !(2 == ~n); 2254#L62 assume ~n > 2; 2232#L63 assume !(~m <= 1); 2201#L66 call #t~ret6 := multiple_of(~n, ~m);< 2260#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2279#L30 assume !(~m < 0); 2278#L33 assume ~n < 0; 2189#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2203#multiple_ofENTRY [2018-11-18 10:51:46,679 INFO L796 eck$LassoCheckResult]: Loop: 2203#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2258#L30 assume !(~m < 0); 2247#L33 assume ~n < 0; 2190#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2203#multiple_ofENTRY [2018-11-18 10:51:46,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1674187120, now seen corresponding path program 1 times [2018-11-18 10:51:46,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:46,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:46,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:46,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:51:46,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:51:46,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:46,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:46,729 INFO L82 PathProgramCache]: Analyzing trace with hash 929675, now seen corresponding path program 1 times [2018-11-18 10:51:46,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:46,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:46,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:46,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:46,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:46,781 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:46,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:46,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:46,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:46,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-18 10:51:46,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:46,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:46,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:46,817 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:46,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,849 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:46,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:46,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:46,882 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:46,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:46,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:46,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:46,920 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:46,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:46,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:46,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:46,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:46,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:46,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:46,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:46,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-18 10:51:46,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:46,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:46,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:46,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:46,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:46,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:46,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:46,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:46,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:46,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:46,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:46,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:46,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:46,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:46,969 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:46,969 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-18 10:51:46,970 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:51:46,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:46,970 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:46,970 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:46,970 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2018-11-18 10:51:46,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:46,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:47,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:47,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:47,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:51:47,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 152 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-18 10:51:47,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 152 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 271 states and 353 transitions. Complement of second has 13 states. [2018-11-18 10:51:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:51:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:51:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 10:51:47,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 10:51:47,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:47,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-18 10:51:47,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:47,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-18 10:51:47,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:47,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 353 transitions. [2018-11-18 10:51:47,072 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-18 10:51:47,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 247 states and 329 transitions. [2018-11-18 10:51:47,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-18 10:51:47,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-18 10:51:47,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 329 transitions. [2018-11-18 10:51:47,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:47,075 INFO L705 BuchiCegarLoop]: Abstraction has 247 states and 329 transitions. [2018-11-18 10:51:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 329 transitions. [2018-11-18 10:51:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-11-18 10:51:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 10:51:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2018-11-18 10:51:47,083 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 284 transitions. [2018-11-18 10:51:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:51:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:51:47,084 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand 7 states. [2018-11-18 10:51:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:47,165 INFO L93 Difference]: Finished difference Result 221 states and 288 transitions. [2018-11-18 10:51:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:51:47,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 288 transitions. [2018-11-18 10:51:47,168 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-18 10:51:47,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 288 transitions. [2018-11-18 10:51:47,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-18 10:51:47,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-11-18 10:51:47,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 288 transitions. [2018-11-18 10:51:47,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:47,170 INFO L705 BuchiCegarLoop]: Abstraction has 221 states and 288 transitions. [2018-11-18 10:51:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 288 transitions. [2018-11-18 10:51:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-11-18 10:51:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 10:51:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 283 transitions. [2018-11-18 10:51:47,177 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 283 transitions. [2018-11-18 10:51:47,177 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 283 transitions. [2018-11-18 10:51:47,177 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:51:47,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 283 transitions. [2018-11-18 10:51:47,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-18 10:51:47,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:47,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:47,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:47,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:51:47,179 INFO L794 eck$LassoCheckResult]: Stem: 3193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3162#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3139#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3152#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3154#L56 assume !(~n <= 1); 3138#L59 assume !(2 == ~n); 3141#L62 assume ~n > 2; 3163#L63 assume !(~m <= 1); 3164#L66 call #t~ret6 := multiple_of(~n, ~m);< 3198#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3196#L30 assume !(~m < 0); 3183#L33 assume !(~n < 0); 3185#L36 assume !(0 == ~m); 3244#L39 assume !(0 == ~n); 3114#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3226#multiple_ofENTRY [2018-11-18 10:51:47,179 INFO L796 eck$LassoCheckResult]: Loop: 3226#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3225#L30 assume !(~m < 0); 3220#L33 assume !(~n < 0); 3148#L36 assume !(0 == ~m); 3149#L39 assume !(0 == ~n); 3118#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3226#multiple_ofENTRY [2018-11-18 10:51:47,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1718912949, now seen corresponding path program 1 times [2018-11-18 10:51:47,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:47,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:47,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 893418406, now seen corresponding path program 1 times [2018-11-18 10:51:47,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:47,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1893667952, now seen corresponding path program 2 times [2018-11-18 10:51:47,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:47,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,247 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:47,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:47,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:47,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:47,247 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:47,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:47,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:47,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:47,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-18 10:51:47,248 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:47,248 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:47,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:47,302 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:47,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:47,307 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:47,307 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:47,322 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:47,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:47,418 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:47,419 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:47,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:47,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:47,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:47,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:47,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:47,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:47,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:47,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-18 10:51:47,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:47,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:47,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:47,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:47,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:47,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:47,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:47,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:47,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:47,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:47,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:47,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:47,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:47,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:47,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:47,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:47,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:47,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:47,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:47,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:47,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:47,470 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:47,472 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:51:47,472 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:51:47,473 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:47,473 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:47,473 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:47,473 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2018-11-18 10:51:47,473 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:47,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:47,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:47,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:47,532 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-11-18 10:51:47,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 283 transitions. cyclomatic complexity: 76 Second operand 6 states. [2018-11-18 10:51:47,588 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 283 transitions. cyclomatic complexity: 76. Second operand 6 states. Result 316 states and 417 transitions. Complement of second has 21 states. [2018-11-18 10:51:47,589 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-11-18 10:51:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:51:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-18 10:51:47,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-18 10:51:47,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:47,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-18 10:51:47,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:47,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-18 10:51:47,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:47,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 417 transitions. [2018-11-18 10:51:47,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-18 10:51:47,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 285 states and 369 transitions. [2018-11-18 10:51:47,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-18 10:51:47,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-18 10:51:47,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 369 transitions. [2018-11-18 10:51:47,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:47,598 INFO L705 BuchiCegarLoop]: Abstraction has 285 states and 369 transitions. [2018-11-18 10:51:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 369 transitions. [2018-11-18 10:51:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2018-11-18 10:51:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-18 10:51:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2018-11-18 10:51:47,604 INFO L728 BuchiCegarLoop]: Abstraction has 252 states and 327 transitions. [2018-11-18 10:51:47,604 INFO L608 BuchiCegarLoop]: Abstraction has 252 states and 327 transitions. [2018-11-18 10:51:47,604 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:51:47,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 252 states and 327 transitions. [2018-11-18 10:51:47,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-18 10:51:47,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:47,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:47,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:47,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:51:47,607 INFO L794 eck$LassoCheckResult]: Stem: 3853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3812#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3813#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3804#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3805#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3807#L56 assume !(~n <= 1); 3908#L59 assume 2 == ~n;#res := 1; 3903#is_prime_FINAL assume true; 3869#is_prime_EXIT >#118#return; 3796#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3784#L51-2 main_#t~ret9 := is_prime_#res;assume { :end_inline_is_prime } true;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 3785#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3832#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 3833#L95 assume main_#t~short13; 3773#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3806#multENTRY ~n := #in~n;~m := #in~m; 3772#L16 assume !(~m < 0); 3775#L19 [2018-11-18 10:51:47,607 INFO L796 eck$LassoCheckResult]: Loop: 3775#L19 assume !(0 == ~m); 3826#L22 assume !(1 == ~m); 3793#L25 call #t~ret1 := mult(~n, ~m - 1);< 3795#multENTRY ~n := #in~n;~m := #in~m; 3838#L16 assume !(~m < 0); 3775#L19 [2018-11-18 10:51:47,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2081524284, now seen corresponding path program 1 times [2018-11-18 10:51:47,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 61272212, now seen corresponding path program 1 times [2018-11-18 10:51:47,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:47,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1269404473, now seen corresponding path program 1 times [2018-11-18 10:51:47,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:47,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:47,687 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:47,687 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:47,687 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:47,687 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:47,688 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:47,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:47,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:47,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:47,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-18 10:51:47,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:47,688 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:47,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:47,731 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:47,731 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:47,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:47,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:47,737 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:47,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:47,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:47,755 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:47,779 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:47,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:47,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:48,486 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:48,487 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:48,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:48,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:48,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:48,488 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:48,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:48,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:48,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:48,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-18 10:51:48,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:48,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:48,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,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-11-18 10:51:48,553 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:48,554 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:48,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:48,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:48,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:48,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:48,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:48,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:48,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:48,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:48,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:48,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:48,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:48,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:48,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:48,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:48,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:48,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:48,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:48,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:48,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:48,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:48,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:48,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:48,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:48,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:48,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:48,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:48,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:48,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:48,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:48,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:48,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:48,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:48,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:48,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:48,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:48,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:48,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:48,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:48,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:48,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:48,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:48,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:48,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:48,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:48,567 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:48,568 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:51:48,568 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:51:48,568 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:48,568 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:48,568 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:48,569 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-18 10:51:48,569 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:48,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:48,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:48,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:48,646 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:51:48,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 252 states and 327 transitions. cyclomatic complexity: 87 Second operand 6 states. [2018-11-18 10:51:48,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 252 states and 327 transitions. cyclomatic complexity: 87. Second operand 6 states. Result 276 states and 354 transitions. Complement of second has 17 states. [2018-11-18 10:51:48,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:51:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:51:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-18 10:51:48,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-18 10:51:48,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-18 10:51:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 17 letters. Loop has 10 letters. [2018-11-18 10:51:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:48,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 354 transitions. [2018-11-18 10:51:48,709 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-18 10:51:48,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 275 states and 353 transitions. [2018-11-18 10:51:48,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-11-18 10:51:48,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-18 10:51:48,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 353 transitions. [2018-11-18 10:51:48,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:48,711 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 353 transitions. [2018-11-18 10:51:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 353 transitions. [2018-11-18 10:51:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 262. [2018-11-18 10:51:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-18 10:51:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 339 transitions. [2018-11-18 10:51:48,715 INFO L728 BuchiCegarLoop]: Abstraction has 262 states and 339 transitions. [2018-11-18 10:51:48,715 INFO L608 BuchiCegarLoop]: Abstraction has 262 states and 339 transitions. [2018-11-18 10:51:48,715 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:51:48,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 339 transitions. [2018-11-18 10:51:48,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-18 10:51:48,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:48,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:48,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:48,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:51:48,716 INFO L794 eck$LassoCheckResult]: Stem: 4489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 4440#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 4421#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4432#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4435#L56 assume !(~n <= 1); 4507#L59 assume 2 == ~n;#res := 1; 4503#is_prime_FINAL assume true; 4502#is_prime_EXIT >#118#return; 4427#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4413#L51-2 main_#t~ret9 := is_prime_#res;assume { :end_inline_is_prime } true;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 4414#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4468#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4469#L95 assume main_#t~short13; 4407#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4433#multENTRY ~n := #in~n;~m := #in~m; 4406#L16 assume !(~m < 0); 4408#L19 assume !(0 == ~m); 4460#L22 assume !(1 == ~m); 4423#L25 call #t~ret1 := mult(~n, ~m - 1);< 4424#multENTRY ~n := #in~n;~m := #in~m; 4511#L16 assume ~m < 0; 4455#L17 [2018-11-18 10:51:48,716 INFO L796 eck$LassoCheckResult]: Loop: 4455#L17 call #t~ret0 := mult(~n, -~m);< 4470#multENTRY ~n := #in~n;~m := #in~m; 4512#L16 assume ~m < 0; 4455#L17 [2018-11-18 10:51:48,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1269404470, now seen corresponding path program 1 times [2018-11-18 10:51:48,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:48,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:48,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:51:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:51:48,762 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:48,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash 139155, now seen corresponding path program 2 times [2018-11-18 10:51:48,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:48,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:48,797 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:48,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:48,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:48,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:48,797 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:48,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:48,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:48,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:48,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-18 10:51:48,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:48,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:48,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:48,828 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:48,828 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:48,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:48,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:48,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:48,844 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:48,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:48,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:48,861 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:48,861 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:48,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:48,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:48,880 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:48,880 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0, mult_#in~n=0} Honda state: {mult_~n=0, mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:48,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:48,895 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:48,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:48,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:49,833 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:49,835 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:49,835 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:49,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:49,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:49,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:49,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:49,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:49,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:49,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-18 10:51:49,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:49,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:49,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:49,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:49,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:49,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:49,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:49,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:49,863 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:49,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:49,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:49,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:49,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:49,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:49,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:49,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:49,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:49,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:49,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:49,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:49,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:49,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:49,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:49,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:49,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:49,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:49,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:49,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:49,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:49,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:49,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:49,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:49,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:49,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:49,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:49,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:51:49,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:49,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:49,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:49,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:49,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:49,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:49,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:49,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:49,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:49,871 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-18 10:51:49,871 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:51:49,871 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:49,872 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:49,872 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:49,872 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-18 10:51:49,872 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:49,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:49,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:49,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:49,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 10:51:49,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 262 states and 339 transitions. cyclomatic complexity: 90 Second operand 5 states. [2018-11-18 10:51:49,975 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 262 states and 339 transitions. cyclomatic complexity: 90. Second operand 5 states. Result 303 states and 385 transitions. Complement of second has 11 states. [2018-11-18 10:51:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:51:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:51:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-18 10:51:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-18 10:51:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-18 10:51:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-18 10:51:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:49,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 385 transitions. [2018-11-18 10:51:49,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-18 10:51:49,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 293 states and 375 transitions. [2018-11-18 10:51:49,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-18 10:51:49,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2018-11-18 10:51:49,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 375 transitions. [2018-11-18 10:51:49,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:49,985 INFO L705 BuchiCegarLoop]: Abstraction has 293 states and 375 transitions. [2018-11-18 10:51:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 375 transitions. [2018-11-18 10:51:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 280. [2018-11-18 10:51:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-18 10:51:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 361 transitions. [2018-11-18 10:51:49,991 INFO L728 BuchiCegarLoop]: Abstraction has 280 states and 361 transitions. [2018-11-18 10:51:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:51:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:51:49,992 INFO L87 Difference]: Start difference. First operand 280 states and 361 transitions. Second operand 5 states. [2018-11-18 10:51:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:50,019 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2018-11-18 10:51:50,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:51:50,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 352 transitions. [2018-11-18 10:51:50,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-18 10:51:50,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 197 states and 237 transitions. [2018-11-18 10:51:50,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-18 10:51:50,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-18 10:51:50,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 237 transitions. [2018-11-18 10:51:50,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:50,023 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 237 transitions. [2018-11-18 10:51:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 237 transitions. [2018-11-18 10:51:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-11-18 10:51:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 10:51:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 210 transitions. [2018-11-18 10:51:50,027 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 210 transitions. [2018-11-18 10:51:50,027 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 210 transitions. [2018-11-18 10:51:50,027 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:51:50,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 210 transitions. [2018-11-18 10:51:50,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 10:51:50,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:50,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:50,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:50,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:51:50,032 INFO L794 eck$LassoCheckResult]: Stem: 5676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 5673#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 5647#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5664#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5666#L56 assume !(~n <= 1); 5742#L59 assume !(2 == ~n); 5741#L62 assume ~n > 2; 5740#L63 assume !(~m <= 1); 5734#L66 call #t~ret6 := multiple_of(~n, ~m);< 5739#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5738#L30 assume !(~m < 0); 5737#L33 assume !(~n < 0); 5736#L36 assume !(0 == ~m); 5735#L39 assume !(0 == ~n); 5691#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5733#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5732#L30 assume !(~m < 0); 5789#L33 assume ~n < 0; 5631#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5775#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5682#L30 assume !(~m < 0); 5628#L33 assume !(~n < 0); 5630#L36 [2018-11-18 10:51:50,033 INFO L796 eck$LassoCheckResult]: Loop: 5630#L36 assume !(0 == ~m); 5661#L39 assume !(0 == ~n); 5649#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5650#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5788#L30 assume !(~m < 0); 5787#L33 assume !(~n < 0); 5630#L36 [2018-11-18 10:51:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1425858095, now seen corresponding path program 1 times [2018-11-18 10:51:50,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:50,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:50,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:51:50,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:51:50,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:50,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:50,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:51:50,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-18 10:51:50,120 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:50,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1367347516, now seen corresponding path program 2 times [2018-11-18 10:51:50,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:50,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:50,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:50,161 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:50,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:50,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:50,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:50,162 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:51:50,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:50,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:50,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:50,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-18 10:51:50,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:50,162 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:50,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-11-18 10:51:50,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:50,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:50,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:50,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:50,205 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:50,206 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:50,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:50,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:50,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:51:50,212 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:50,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:51:50,227 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/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-11-18 10:51:50,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:51:50,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:51:51,537 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:51:51,538 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:51:51,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:51:51,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:51:51,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:51:51,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:51:51,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:51:51,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:51:51,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:51:51,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-18 10:51:51,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:51:51,538 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:51:51,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:51,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:51,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:51:51,581 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:51:51,582 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:51:51,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:51:51,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:51:51,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:51:51,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:51:51,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:51:51,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:51:51,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:51:51,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:51:51,585 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:51:51,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:51:51,587 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:51:51,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:51:51,587 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:51:51,587 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:51:51,587 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2018-11-18 10:51:51,587 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:51:51,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:51,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:51,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:51,671 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-11-18 10:51:51,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-18 10:51:51,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 198 states and 242 transitions. Complement of second has 15 states. [2018-11-18 10:51:51,738 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-11-18 10:51:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:51:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 10:51:51,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-18 10:51:51,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:51,739 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:51:51,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:51,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:51,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:51,800 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-11-18 10:51:51,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-18 10:51:51,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 198 states and 242 transitions. Complement of second has 15 states. [2018-11-18 10:51:51,857 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-11-18 10:51:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:51:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-18 10:51:51,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-18 10:51:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:51,857 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:51:51,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:51,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:51,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:51,913 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-11-18 10:51:51,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-18 10:51:51,981 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 266 states and 320 transitions. Complement of second has 16 states. [2018-11-18 10:51:51,981 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-11-18 10:51:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 10:51:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-18 10:51:51,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-18 10:51:51,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:51,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-18 10:51:51,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:51,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-18 10:51:51,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:51:51,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 320 transitions. [2018-11-18 10:51:51,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-18 10:51:51,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 224 states and 271 transitions. [2018-11-18 10:51:51,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-18 10:51:51,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-18 10:51:51,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 271 transitions. [2018-11-18 10:51:51,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:51,984 INFO L705 BuchiCegarLoop]: Abstraction has 224 states and 271 transitions. [2018-11-18 10:51:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 271 transitions. [2018-11-18 10:51:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2018-11-18 10:51:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-18 10:51:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2018-11-18 10:51:51,988 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 227 transitions. [2018-11-18 10:51:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:51:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:51:51,989 INFO L87 Difference]: Start difference. First operand 183 states and 227 transitions. Second operand 8 states. [2018-11-18 10:51:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:52,050 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2018-11-18 10:51:52,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:51:52,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 300 transitions. [2018-11-18 10:51:52,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 10:51:52,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 234 states and 290 transitions. [2018-11-18 10:51:52,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-18 10:51:52,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-18 10:51:52,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 290 transitions. [2018-11-18 10:51:52,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:52,054 INFO L705 BuchiCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-11-18 10:51:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 290 transitions. [2018-11-18 10:51:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2018-11-18 10:51:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-18 10:51:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 267 transitions. [2018-11-18 10:51:52,070 INFO L728 BuchiCegarLoop]: Abstraction has 213 states and 267 transitions. [2018-11-18 10:51:52,070 INFO L608 BuchiCegarLoop]: Abstraction has 213 states and 267 transitions. [2018-11-18 10:51:52,070 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:51:52,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 267 transitions. [2018-11-18 10:51:52,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 10:51:52,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:52,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:52,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:52,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:52,075 INFO L794 eck$LassoCheckResult]: Stem: 7370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 7363#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 7328#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7352#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7354#L56 assume !(~n <= 1); 7341#L59 assume !(2 == ~n); 7342#L62 assume ~n > 2; 7367#L63 assume !(~m <= 1); 7316#L66 call #t~ret6 := multiple_of(~n, ~m);< 7381#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7382#L30 assume !(~m < 0); 7315#L33 assume !(~n < 0); 7317#L36 assume !(0 == ~m); 7429#L39 assume !(0 == ~n); 7365#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7387#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7431#L30 assume !(~m < 0); 7430#L33 assume !(~n < 0); 7428#L36 assume !(0 == ~m); 7364#L39 assume !(0 == ~n); 7337#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7386#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7416#L30 assume !(~m < 0); 7413#L33 assume ~n < 0; 7336#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7338#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7420#L30 assume !(~m < 0); 7424#L33 assume !(~n < 0); 7410#L36 [2018-11-18 10:51:52,075 INFO L796 eck$LassoCheckResult]: Loop: 7410#L36 assume !(0 == ~m); 7421#L39 assume !(0 == ~n); 7394#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7417#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7414#L30 assume !(~m < 0); 7393#L33 assume ~n < 0; 7395#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7412#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7411#L30 assume !(~m < 0); 7409#L33 assume !(~n < 0); 7410#L36 [2018-11-18 10:51:52,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1154252276, now seen corresponding path program 2 times [2018-11-18 10:51:52,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:52,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:52,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:52,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2073798158, now seen corresponding path program 1 times [2018-11-18 10:51:52,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:52,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:52,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:52,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1536095683, now seen corresponding path program 3 times [2018-11-18 10:51:52,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:52,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:52,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:52,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:52,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:51:52 BoogieIcfgContainer [2018-11-18 10:51:52,544 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:51:52,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:51:52,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:51:52,545 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:51:52,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:51:43" (3/4) ... [2018-11-18 10:51:52,547 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 10:51:52,576 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dc2b341d-bb43-4901-917f-6290622298ec/bin-2019/uautomizer/witness.graphml [2018-11-18 10:51:52,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:51:52,577 INFO L168 Benchmark]: Toolchain (without parser) took 9994.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -106.3 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:51:52,578 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:51:52,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.13 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:51:52,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.84 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:51:52,579 INFO L168 Benchmark]: Boogie Preprocessor took 12.12 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:51:52,579 INFO L168 Benchmark]: RCFGBuilder took 267.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:51:52,580 INFO L168 Benchmark]: BuchiAutomizer took 9499.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:51:52,580 INFO L168 Benchmark]: Witness Printer took 31.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:51:52,582 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.13 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 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.84 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.12 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 267.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9499.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. * Witness Printer took 31.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. 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 16 terminating modules (8 trivial, 7 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 9 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(n) and consists of 4 locations. One deterministic module has affine ranking function \old(n) and consists of 6 locations. One deterministic module has affine ranking function m and consists of 6 locations. One deterministic module has affine ranking function m and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 213 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 6.9s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 304 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 262 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 711 SDtfs, 715 SDslu, 1175 SDs, 0 SdLazy, 884 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf99 lsp81 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq175 hnf92 smp90 dnf100 smp100 tf109 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 36]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b27e02d=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47e9449e=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30a021c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a218f38=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@99d9c32=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aeb67c7=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@324a85ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c0d9b27=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71882218=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d40127f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28161c62=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2231a0d6=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L75] int n = __VERIFIER_nondet_int(); [L76] COND FALSE !(n < 1 || n > 46340) [L81] CALL is_prime(n) [L51] CALL is_prime_(n, n - 1) [L56] COND FALSE !(n <= 1) [L59] COND FALSE !(n == 2) [L62] COND TRUE n > 2 [L63] COND FALSE !(m <= 1) [L66] CALL multiple_of(n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) Loop: [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...