./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/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-635dfa2 [2018-12-01 22:54:35,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:54:35,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:54:35,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:54:35,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:54:35,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:54:35,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:54:35,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:54:35,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:54:35,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:54:35,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:54:35,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:54:35,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:54:35,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:54:35,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:54:35,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:54:35,741 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:54:35,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:54:35,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:54:35,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:54:35,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:54:35,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:54:35,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:54:35,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:54:35,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:54:35,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:54:35,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:54:35,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:54:35,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:54:35,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:54:35,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:54:35,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:54:35,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:54:35,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:54:35,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:54:35,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:54:35,749 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 22:54:35,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:54:35,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:54:35,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:54:35,757 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:54:35,757 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:54:35,757 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 22:54:35,757 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 22:54:35,757 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 22:54:35,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 22:54:35,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 22:54:35,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 22:54:35,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:54:35,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:54:35,760 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 22:54:35,760 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 22:54:35,760 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_b8f81222-9a6a-4dde-92ad-249591060d71/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-12-01 22:54:35,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:54:35,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:54:35,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:54:35,786 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:54:35,786 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:54:35,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-12-01 22:54:35,820 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/data/caf89df0d/b06353ed10d7401095a061a6045e18fc/FLAG6a25f95ec [2018-12-01 22:54:36,232 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:54:36,233 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-12-01 22:54:36,237 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/data/caf89df0d/b06353ed10d7401095a061a6045e18fc/FLAG6a25f95ec [2018-12-01 22:54:36,245 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/data/caf89df0d/b06353ed10d7401095a061a6045e18fc [2018-12-01 22:54:36,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:54:36,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:54:36,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:54:36,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:54:36,251 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:54:36,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b10df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36, skipping insertion in model container [2018-12-01 22:54:36,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:54:36,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:54:36,357 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:54:36,359 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:54:36,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:54:36,379 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:54:36,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36 WrapperNode [2018-12-01 22:54:36,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:54:36,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:54:36,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:54:36,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:54:36,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:54:36,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:54:36,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:54:36,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:54:36,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... [2018-12-01 22:54:36,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:54:36,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:54:36,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:54:36,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:54:36,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2018-12-01 22:54:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2018-12-01 22:54:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-12-01 22:54:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-12-01 22:54:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:54:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:54:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2018-12-01 22:54:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2018-12-01 22:54:36,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:54:36,603 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-01 22:54:36,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:54:36 BoogieIcfgContainer [2018-12-01 22:54:36,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:54:36,604 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 22:54:36,604 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 22:54:36,606 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 22:54:36,606 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:54:36,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 10:54:36" (1/3) ... [2018-12-01 22:54:36,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d81413d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:54:36, skipping insertion in model container [2018-12-01 22:54:36,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:54:36,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:54:36" (2/3) ... [2018-12-01 22:54:36,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d81413d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:54:36, skipping insertion in model container [2018-12-01 22:54:36,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:54:36,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:54:36" (3/3) ... [2018-12-01 22:54:36,608 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-12-01 22:54:36,641 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:54:36,641 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 22:54:36,642 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 22:54:36,642 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 22:54:36,642 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:54:36,642 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:54:36,642 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 22:54:36,642 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:54:36,642 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 22:54:36,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-12-01 22:54:36,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 22:54:36,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:36,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:36,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:54:36,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:36,674 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 22:54:36,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-12-01 22:54:36,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 22:54:36,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:36,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:36,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:54:36,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:36,682 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue 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; 13#L76true assume !(main_~n~0 < 1 || main_~n~0 > 46340);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-12-01 22:54:36,683 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 41#L56true assume !(~n <= 1); 35#L59true assume !(2 == ~n); 25#L62true assume ~n > 2; 39#L63true assume !(~m <= 1); 32#L66true call #t~ret6 := multiple_of(~n, ~m);< 51#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 31#L30true assume !(~m < 0); 24#L33true assume !(~n < 0); 37#L36true assume 0 == ~m;#res := 0; 27#multiple_ofFINALtrue assume true; 46#multiple_ofEXITtrue >#121#return; 30#L66-1true assume !(0 == #t~ret6);havoc #t~ret6; 23#L69true call #t~ret7 := is_prime_(~n, ~m - 1);< 12#is_prime_ENTRYtrue [2018-12-01 22:54:36,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2018-12-01 22:54:36,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:36,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:36,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:36,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:36,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2018-12-01 22:54:36,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:36,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:36,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:36,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:54:36,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:54:36,799 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:54:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:54:36,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:54:36,809 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-12-01 22:54:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:36,881 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-12-01 22:54:36,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:54:36,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2018-12-01 22:54:36,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 22:54:36,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2018-12-01 22:54:36,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-01 22:54:36,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-01 22:54:36,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-12-01 22:54:36,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:54:36,893 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-12-01 22:54:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-12-01 22:54:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-12-01 22:54:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-01 22:54:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-12-01 22:54:36,912 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-12-01 22:54:36,913 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-12-01 22:54:36,913 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 22:54:36,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2018-12-01 22:54:36,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 22:54:36,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:36,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:36,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:54:36,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:36,914 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY 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; 143#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 132#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 140#is_prime_ENTRY [2018-12-01 22:54:36,914 INFO L796 eck$LassoCheckResult]: Loop: 140#is_prime_ENTRY ~n := #in~n;~m := #in~m; 141#L56 assume !(~n <= 1); 131#L59 assume !(2 == ~n); 135#L62 assume ~n > 2; 142#L63 assume !(~m <= 1); 118#L66 call #t~ret6 := multiple_of(~n, ~m);< 128#multiple_ofENTRY ~n := #in~n;~m := #in~m; 153#L30 assume !(~m < 0); 149#L33 assume !(~n < 0); 138#L36 assume !(0 == ~m); 139#L39 assume 0 == ~n;#res := 1; 122#multiple_ofFINAL assume true; 150#multiple_ofEXIT >#121#return; 151#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 133#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 140#is_prime_ENTRY [2018-12-01 22:54:36,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2018-12-01 22:54:36,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:36,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2018-12-01 22:54:36,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:54:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:36,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:54:36,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:54:36,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:54:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:54:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:54:36,953 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-01 22:54:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:36,992 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-12-01 22:54:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:54:36,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-12-01 22:54:36,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 22:54:36,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2018-12-01 22:54:36,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-01 22:54:36,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-01 22:54:36,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2018-12-01 22:54:36,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:54:36,997 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2018-12-01 22:54:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2018-12-01 22:54:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-01 22:54:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-01 22:54:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-12-01 22:54:37,000 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-12-01 22:54:37,001 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-12-01 22:54:37,001 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 22:54:37,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2018-12-01 22:54:37,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-12-01 22:54:37,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:37,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:37,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:54:37,002 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-12-01 22:54:37,002 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY 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; 233#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 222#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 230#is_prime_ENTRY [2018-12-01 22:54:37,002 INFO L796 eck$LassoCheckResult]: Loop: 230#is_prime_ENTRY ~n := #in~n;~m := #in~m; 231#L56 assume !(~n <= 1); 221#L59 assume !(2 == ~n); 225#L62 assume ~n > 2; 232#L63 assume !(~m <= 1); 208#L66 call #t~ret6 := multiple_of(~n, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume !(0 == ~n); 209#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume 0 == ~n;#res := 1; 212#multiple_ofFINAL assume true; 241#multiple_ofEXIT >#111#return; 234#L42-1 #res := #t~ret4;havoc #t~ret4; 235#multiple_ofFINAL assume true; 246#multiple_ofEXIT >#121#return; 243#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 223#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 230#is_prime_ENTRY [2018-12-01 22:54:37,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2018-12-01 22:54:37,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:37,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:37,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2018-12-01 22:54:37,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:37,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:54:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:37,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2018-12-01 22:54:37,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:37,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:37,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 22:54:37,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 22:54:37,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/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-12-01 22:54:37,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:37,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 22:54:37,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 22:54:37,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-01 22:54:37,321 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:37,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:37,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:37,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:37,322 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:37,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:37,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:37,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-12-01 22:54:37,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:37,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:37,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,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-12-01 22:54:37,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,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-12-01 22:54:37,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:37,381 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:37,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:37,389 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:37,389 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:37,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:37,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:37,407 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:37,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:37,424 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:37,424 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:37,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:37,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:37,440 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:37,455 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:37,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:37,504 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:37,505 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:37,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:37,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:37,506 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:37,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:37,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:37,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:37,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:37,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-12-01 22:54:37,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:37,506 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:37,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:37,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:37,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:37,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:37,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:37,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:37,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:37,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:37,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:37,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:37,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:37,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:37,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:37,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:37,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:37,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:37,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:37,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:37,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:37,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:37,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:37,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-12-01 22:54:37,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:37,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:37,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:37,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:37,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:37,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:37,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:37,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:37,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-12-01 22:54:37,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:37,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:37,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:37,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:37,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:37,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:37,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:37,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:37,573 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 22:54:37,573 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 22:54:37,574 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:37,574 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:37,574 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:37,574 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2018-12-01 22:54:37,575 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:37,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:37,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:37,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 22:54:37,697 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-12-01 22:54:37,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-12-01 22:54:37,935 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 174 states and 238 transitions. Complement of second has 40 states. [2018-12-01 22:54:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 22:54:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-12-01 22:54:37,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2018-12-01 22:54:37,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:37,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2018-12-01 22:54:37,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:37,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2018-12-01 22:54:37,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:37,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2018-12-01 22:54:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-12-01 22:54:37,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2018-12-01 22:54:37,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-12-01 22:54:37,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-12-01 22:54:37,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2018-12-01 22:54:37,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:37,950 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2018-12-01 22:54:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2018-12-01 22:54:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2018-12-01 22:54:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-01 22:54:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2018-12-01 22:54:37,959 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2018-12-01 22:54:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 22:54:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:54:37,959 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 9 states. [2018-12-01 22:54:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:38,093 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2018-12-01 22:54:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:54:38,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2018-12-01 22:54:38,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-12-01 22:54:38,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2018-12-01 22:54:38,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-12-01 22:54:38,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-12-01 22:54:38,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2018-12-01 22:54:38,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:38,098 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2018-12-01 22:54:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2018-12-01 22:54:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-12-01 22:54:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-01 22:54:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2018-12-01 22:54:38,103 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-12-01 22:54:38,103 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-12-01 22:54:38,103 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 22:54:38,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2018-12-01 22:54:38,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-12-01 22:54:38,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:38,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:38,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:38,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:54:38,105 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY 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; 965#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 942#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 957#is_prime_ENTRY ~n := #in~n;~m := #in~m; 959#L56 assume !(~n <= 1); 941#L59 assume !(2 == ~n); 944#L62 assume ~n > 2; 962#L63 assume !(~m <= 1); 936#L66 call #t~ret6 := multiple_of(~n, ~m);< 994#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1022#L30 assume ~m < 0; 969#L31 [2018-12-01 22:54:38,105 INFO L796 eck$LassoCheckResult]: Loop: 969#L31 call #t~ret2 := multiple_of(~n, -~m);< 973#multiple_ofENTRY ~n := #in~n;~m := #in~m; 990#L30 assume ~m < 0; 969#L31 [2018-12-01 22:54:38,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2018-12-01 22:54:38,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:38,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:54:38,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:54:38,124 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:54:38,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2018-12-01 22:54:38,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:38,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:38,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:38,156 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:38,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:38,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:38,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:38,157 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:38,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:38,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:38,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-12-01 22:54:38,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:38,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:38,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,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-12-01 22:54:38,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:38,191 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:38,192 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:38,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:38,194 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:38,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:38,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:38,212 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:38,226 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:38,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:38,229 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:38,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:38,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:38,246 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:38,260 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:38,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:38,851 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:38,853 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:38,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:38,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:38,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:38,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:38,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:38,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:38,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:38,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-12-01 22:54:38,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:38,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:38,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,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-12-01 22:54:38,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:38,883 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:38,883 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:38,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:38,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:38,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:38,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:38,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:38,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:38,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:38,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:38,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:38,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:38,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:38,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:38,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:38,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:38,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:38,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:38,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:38,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:38,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:38,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:38,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:38,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:38,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:38,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:38,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:38,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:38,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:38,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:38,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:38,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:38,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:38,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:38,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:38,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:38,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:38,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:38,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:38,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:38,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:38,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:38,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:38,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:38,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:38,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:38,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:38,894 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-12-01 22:54:38,894 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:54:38,894 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:38,894 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:38,894 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:38,894 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2018-12-01 22:54:38,894 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:38,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:38,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:38,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:38,928 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 22:54:38,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-12-01 22:54:38,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 209 states and 271 transitions. Complement of second has 18 states. [2018-12-01 22:54:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 22:54:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-12-01 22:54:38,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 22:54:38,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:38,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 22:54:38,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:38,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-01 22:54:38,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:38,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2018-12-01 22:54:38,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2018-12-01 22:54:38,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2018-12-01 22:54:38,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-12-01 22:54:38,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-12-01 22:54:38,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2018-12-01 22:54:38,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:38,970 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2018-12-01 22:54:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2018-12-01 22:54:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-12-01 22:54:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-01 22:54:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2018-12-01 22:54:38,976 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2018-12-01 22:54:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:54:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:54:38,976 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2018-12-01 22:54:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:39,014 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-12-01 22:54:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:54:39,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2018-12-01 22:54:39,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-01 22:54:39,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2018-12-01 22:54:39,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-12-01 22:54:39,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-12-01 22:54:39,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2018-12-01 22:54:39,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:39,018 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2018-12-01 22:54:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2018-12-01 22:54:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-12-01 22:54:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-01 22:54:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-12-01 22:54:39,024 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-12-01 22:54:39,024 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-12-01 22:54:39,024 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 22:54:39,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2018-12-01 22:54:39,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-01 22:54:39,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:39,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:39,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:39,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:54:39,026 INFO L794 eck$LassoCheckResult]: Stem: 1623#ULTIMATE.startENTRY 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; 1605#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 1585#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1597#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1599#L56 assume ~n <= 1;#res := 0; 1586#is_prime_FINAL assume true; 1632#is_prime_EXIT >#117#return; 1592#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1582#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 1583#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1615#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 1616#L95 assume main_#t~short13; 1575#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1591#multENTRY [2018-12-01 22:54:39,026 INFO L796 eck$LassoCheckResult]: Loop: 1591#multENTRY ~n := #in~n;~m := #in~m; 1573#L16 assume ~m < 0; 1576#L17 call #t~ret0 := mult(~n, -~m);< 1591#multENTRY [2018-12-01 22:54:39,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2018-12-01 22:54:39,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:39,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:54:39,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:54:39,053 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:54:39,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2018-12-01 22:54:39,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,078 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:39,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:39,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:39,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:39,079 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:39,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:39,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:39,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-12-01 22:54:39,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:39,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:39,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,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-12-01 22:54:39,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:39,110 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,114 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,131 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,147 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,164 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,164 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,180 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,197 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,212 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:39,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,247 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:39,248 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:39,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:39,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:39,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:39,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:39,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:39,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:39,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-12-01 22:54:39,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:39,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:39,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,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-12-01 22:54:39,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:39,283 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:39,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:39,294 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-12-01 22:54:39,294 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:54:39,294 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:39,294 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:39,294 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:39,294 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2018-12-01 22:54:39,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:39,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:39,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:39,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:39,352 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-12-01 22:54:39,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2018-12-01 22:54:39,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34. Second operand 5 states. Result 142 states and 176 transitions. Complement of second has 14 states. [2018-12-01 22:54:39,412 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-12-01 22:54:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 22:54:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-12-01 22:54:39,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-01 22:54:39,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:39,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2018-12-01 22:54:39,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:39,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2018-12-01 22:54:39,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:39,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2018-12-01 22:54:39,414 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-01 22:54:39,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2018-12-01 22:54:39,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-12-01 22:54:39,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-12-01 22:54:39,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2018-12-01 22:54:39,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:39,416 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2018-12-01 22:54:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2018-12-01 22:54:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-12-01 22:54:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-01 22:54:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2018-12-01 22:54:39,420 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2018-12-01 22:54:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:54:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:54:39,420 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2018-12-01 22:54:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:39,443 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2018-12-01 22:54:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:54:39,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2018-12-01 22:54:39,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-01 22:54:39,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2018-12-01 22:54:39,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-12-01 22:54:39,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-12-01 22:54:39,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2018-12-01 22:54:39,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:39,445 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-12-01 22:54:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2018-12-01 22:54:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-12-01 22:54:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-01 22:54:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2018-12-01 22:54:39,448 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-12-01 22:54:39,448 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-12-01 22:54:39,448 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 22:54:39,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2018-12-01 22:54:39,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-01 22:54:39,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:39,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:39,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:39,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 22:54:39,449 INFO L794 eck$LassoCheckResult]: Stem: 2228#ULTIMATE.startENTRY 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; 2206#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 2185#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2195#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2198#L56 assume !(~n <= 1); 2241#L59 assume !(2 == ~n); 2242#L62 assume ~n > 2; 2202#L63 assume !(~m <= 1); 2173#L66 call #t~ret6 := multiple_of(~n, ~m);< 2233#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2231#L30 assume !(~m < 0); 2219#L33 assume ~n < 0; 2160#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2018-12-01 22:54:39,449 INFO L796 eck$LassoCheckResult]: Loop: 2175#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2235#L30 assume !(~m < 0); 2260#L33 assume ~n < 0; 2161#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2018-12-01 22:54:39,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2018-12-01 22:54:39,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:39,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:54:39,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:54:39,475 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:54:39,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2018-12-01 22:54:39,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,501 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:39,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:39,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:39,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:39,501 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:39,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:39,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:39,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-12-01 22:54:39,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:39,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:39,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,543 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:39,543 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/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-12-01 22:54:39,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,548 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,565 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,581 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,581 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,595 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/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-12-01 22:54:39,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:39,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,630 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:39,632 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:39,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:39,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:39,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:39,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:39,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:39,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:39,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-12-01 22:54:39,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:39,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:39,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,667 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:39,668 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:39,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:39,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:39,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:39,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:39,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:39,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:39,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:39,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:39,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:39,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:39,675 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-12-01 22:54:39,675 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:54:39,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:39,676 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:39,676 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:39,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2018-12-01 22:54:39,676 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:39,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:39,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:39,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:39,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-01 22:54:39,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-12-01 22:54:39,740 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 270 states and 352 transitions. Complement of second has 13 states. [2018-12-01 22:54:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 22:54:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-12-01 22:54:39,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2018-12-01 22:54:39,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:39,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2018-12-01 22:54:39,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:39,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-01 22:54:39,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:39,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2018-12-01 22:54:39,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-12-01 22:54:39,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2018-12-01 22:54:39,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-12-01 22:54:39,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-12-01 22:54:39,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2018-12-01 22:54:39,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:39,745 INFO L705 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2018-12-01 22:54:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2018-12-01 22:54:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2018-12-01 22:54:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-01 22:54:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2018-12-01 22:54:39,750 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2018-12-01 22:54:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:54:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:54:39,750 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2018-12-01 22:54:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:39,798 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2018-12-01 22:54:39,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:54:39,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 279 transitions. [2018-12-01 22:54:39,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-12-01 22:54:39,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 279 transitions. [2018-12-01 22:54:39,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-12-01 22:54:39,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-12-01 22:54:39,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 279 transitions. [2018-12-01 22:54:39,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:39,801 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-12-01 22:54:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 279 transitions. [2018-12-01 22:54:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-12-01 22:54:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-01 22:54:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2018-12-01 22:54:39,805 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-12-01 22:54:39,805 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-12-01 22:54:39,805 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 22:54:39,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 279 transitions. [2018-12-01 22:54:39,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-12-01 22:54:39,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:39,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:39,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:39,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 22:54:39,806 INFO L794 eck$LassoCheckResult]: Stem: 3156#ULTIMATE.startENTRY 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; 3126#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 3114#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3115#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3118#L56 assume !(~n <= 1); 3171#L59 assume !(2 == ~n); 3172#L62 assume ~n > 2; 3173#L63 assume !(~m <= 1); 3161#L66 call #t~ret6 := multiple_of(~n, ~m);< 3168#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3160#L30 assume !(~m < 0); 3162#L33 assume !(~n < 0); 3226#L36 assume !(0 == ~m); 3224#L39 assume !(0 == ~n); 3072#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2018-12-01 22:54:39,806 INFO L796 eck$LassoCheckResult]: Loop: 3194#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3192#L30 assume !(~m < 0); 3186#L33 assume !(~n < 0); 3187#L36 assume !(0 == ~m); 3225#L39 assume !(0 == ~n); 3071#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2018-12-01 22:54:39,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2018-12-01 22:54:39,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2018-12-01 22:54:39,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2018-12-01 22:54:39,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:39,861 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:39,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:39,861 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:39,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:39,861 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:39,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:39,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:39,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-12-01 22:54:39,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:39,862 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:39,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-12-01 22:54:39,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:39,905 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:39,905 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:39,909 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:39,909 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:39,923 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:39,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:39,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:40,016 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:40,018 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:40,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:40,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:40,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:40,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:40,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:40,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:40,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:40,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-12-01 22:54:40,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:40,019 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:40,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:40,073 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:40,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:40,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:40,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:40,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:40,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:40,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:40,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:40,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:40,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:40,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:40,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:40,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:40,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:40,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:40,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:40,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:40,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:40,077 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:40,078 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:54:40,078 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:54:40,078 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:40,078 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:40,078 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:40,078 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2018-12-01 22:54:40,078 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:40,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:40,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:40,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:40,137 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 22:54:40,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75 Second operand 6 states. [2018-12-01 22:54:40,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75. Second operand 6 states. Result 313 states and 413 transitions. Complement of second has 21 states. [2018-12-01 22:54:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:54:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-12-01 22:54:40,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-01 22:54:40,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:40,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2018-12-01 22:54:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2018-12-01 22:54:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:40,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 413 transitions. [2018-12-01 22:54:40,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-12-01 22:54:40,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 282 states and 365 transitions. [2018-12-01 22:54:40,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-12-01 22:54:40,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-12-01 22:54:40,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 365 transitions. [2018-12-01 22:54:40,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:40,208 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 365 transitions. [2018-12-01 22:54:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 365 transitions. [2018-12-01 22:54:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 249. [2018-12-01 22:54:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-01 22:54:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 323 transitions. [2018-12-01 22:54:40,213 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-12-01 22:54:40,213 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-12-01 22:54:40,213 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 22:54:40,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 323 transitions. [2018-12-01 22:54:40,214 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-12-01 22:54:40,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:40,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:40,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:40,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 22:54:40,215 INFO L794 eck$LassoCheckResult]: Stem: 3796#ULTIMATE.startENTRY 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; 3765#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 3753#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3754#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3757#L56 assume !(~n <= 1); 3845#L59 assume 2 == ~n;#res := 1; 3843#is_prime_FINAL assume true; 3810#is_prime_EXIT >#117#return; 3746#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3732#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 3733#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3775#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 3776#L95 assume main_#t~short13; 3721#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3755#multENTRY ~n := #in~n;~m := #in~m; 3720#L16 assume !(~m < 0); 3723#L19 [2018-12-01 22:54:40,215 INFO L796 eck$LassoCheckResult]: Loop: 3723#L19 assume !(0 == ~m); 3771#L22 assume !(1 == ~m); 3743#L25 call #t~ret1 := mult(~n, ~m - 1);< 3745#multENTRY ~n := #in~n;~m := #in~m; 3782#L16 assume !(~m < 0); 3723#L19 [2018-12-01 22:54:40,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2018-12-01 22:54:40,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:40,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:40,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:54:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:40,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2018-12-01 22:54:40,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:40,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:40,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2018-12-01 22:54:40,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:40,284 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:40,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:40,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:40,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:40,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:40,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:40,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:40,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:40,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-12-01 22:54:40,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:40,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:40,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:40,325 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:40,325 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:40,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:40,327 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:40,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:40,328 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:40,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:40,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:40,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:40,345 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:40,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:40,360 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:40,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:40,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:41,060 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:41,062 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:41,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:41,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:41,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:41,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:41,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:41,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:41,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-12-01 22:54:41,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:41,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:41,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,103 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:41,103 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:41,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:41,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:41,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:41,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:41,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:41,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:41,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:41,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:41,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:41,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:41,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:41,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:41,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:41,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:41,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:41,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:41,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:41,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:41,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:41,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:41,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:41,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:41,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:41,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:41,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:41,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:41,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:41,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:41,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:41,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:41,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:41,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:41,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:41,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:41,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:41,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:41,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:41,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:41,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:41,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:41,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:41,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:41,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:41,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:41,113 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:41,114 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:54:41,114 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:54:41,114 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:41,114 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:41,114 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:41,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-12-01 22:54:41,115 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:41,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:41,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:41,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:41,167 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-12-01 22:54:41,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86 Second operand 6 states. [2018-12-01 22:54:41,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86. Second operand 6 states. Result 273 states and 350 transitions. Complement of second has 17 states. [2018-12-01 22:54:41,221 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-12-01 22:54:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:54:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-12-01 22:54:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-01 22:54:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2018-12-01 22:54:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:41,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2018-12-01 22:54:41,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:41,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 350 transitions. [2018-12-01 22:54:41,224 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-12-01 22:54:41,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 272 states and 349 transitions. [2018-12-01 22:54:41,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-12-01 22:54:41,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-12-01 22:54:41,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 349 transitions. [2018-12-01 22:54:41,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:41,227 INFO L705 BuchiCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-12-01 22:54:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 349 transitions. [2018-12-01 22:54:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-12-01 22:54:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-01 22:54:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 335 transitions. [2018-12-01 22:54:41,231 INFO L728 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-12-01 22:54:41,231 INFO L608 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-12-01 22:54:41,231 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 22:54:41,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 335 transitions. [2018-12-01 22:54:41,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-12-01 22:54:41,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:41,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:41,233 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] [2018-12-01 22:54:41,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:54:41,234 INFO L794 eck$LassoCheckResult]: Stem: 4429#ULTIMATE.startENTRY 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; 4393#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 4380#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4381#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4384#L56 assume !(~n <= 1); 4443#L59 assume 2 == ~n;#res := 1; 4442#is_prime_FINAL assume true; 4440#is_prime_EXIT >#117#return; 4373#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4357#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 4358#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4409#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4410#L95 assume main_#t~short13; 4348#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4382#multENTRY ~n := #in~n;~m := #in~m; 4345#L16 assume !(~m < 0); 4347#L19 assume !(0 == ~m); 4404#L22 assume !(1 == ~m); 4411#L25 call #t~ret1 := mult(~n, ~m - 1);< 4590#multENTRY ~n := #in~n;~m := #in~m; 4448#L16 assume ~m < 0; 4369#L17 [2018-12-01 22:54:41,234 INFO L796 eck$LassoCheckResult]: Loop: 4369#L17 call #t~ret0 := mult(~n, -~m);< 4370#multENTRY ~n := #in~n;~m := #in~m; 4449#L16 assume ~m < 0; 4369#L17 [2018-12-01 22:54:41,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2018-12-01 22:54:41,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:41,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:41,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:41,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:54:41,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:54:41,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:54:41,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2018-12-01 22:54:41,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:41,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:41,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:41,292 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:41,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:41,293 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:41,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:41,293 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:41,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:41,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:41,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-12-01 22:54:41,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:41,293 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:41,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:41,327 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:41,327 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:41,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:41,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:41,332 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:41,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:41,348 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:41,348 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,372 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:41,372 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:41,375 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:41,375 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:41,390 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:41,407 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:41,408 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:42,324 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:42,326 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:42,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:42,326 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:42,326 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:42,326 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:42,326 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:42,326 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:42,326 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:42,326 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-12-01 22:54:42,326 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:42,326 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:42,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,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-12-01 22:54:42,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,365 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:42,366 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:42,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:42,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:42,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:42,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:42,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:42,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:42,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:42,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:42,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:42,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:42,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:42,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:42,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:42,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:42,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:42,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:42,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:42,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:42,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:42,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:42,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:42,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:42,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:42,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:42,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:42,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:42,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:54:42,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:42,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:42,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:42,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:42,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:42,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:42,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:42,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:42,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:42,371 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-12-01 22:54:42,372 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:54:42,372 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:42,372 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:42,372 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:42,372 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-12-01 22:54:42,372 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:42,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:42,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:42,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:42,427 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-12-01 22:54:42,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89 Second operand 5 states. [2018-12-01 22:54:42,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89. Second operand 5 states. Result 300 states and 381 transitions. Complement of second has 11 states. [2018-12-01 22:54:42,475 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-12-01 22:54:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 22:54:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-12-01 22:54:42,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2018-12-01 22:54:42,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:42,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-01 22:54:42,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:42,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2018-12-01 22:54:42,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:42,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 381 transitions. [2018-12-01 22:54:42,478 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-12-01 22:54:42,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 290 states and 371 transitions. [2018-12-01 22:54:42,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-12-01 22:54:42,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-12-01 22:54:42,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 371 transitions. [2018-12-01 22:54:42,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:42,481 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 371 transitions. [2018-12-01 22:54:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 371 transitions. [2018-12-01 22:54:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-12-01 22:54:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-01 22:54:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2018-12-01 22:54:42,487 INFO L728 BuchiCegarLoop]: Abstraction has 277 states and 357 transitions. [2018-12-01 22:54:42,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:54:42,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:54:42,487 INFO L87 Difference]: Start difference. First operand 277 states and 357 transitions. Second operand 5 states. [2018-12-01 22:54:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:42,506 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2018-12-01 22:54:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:54:42,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 348 transitions. [2018-12-01 22:54:42,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-01 22:54:42,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 196 states and 236 transitions. [2018-12-01 22:54:42,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-12-01 22:54:42,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-12-01 22:54:42,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2018-12-01 22:54:42,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:42,509 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2018-12-01 22:54:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2018-12-01 22:54:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2018-12-01 22:54:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-01 22:54:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2018-12-01 22:54:42,511 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-12-01 22:54:42,511 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-12-01 22:54:42,511 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 22:54:42,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2018-12-01 22:54:42,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-01 22:54:42,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:42,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:42,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:42,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 22:54:42,512 INFO L794 eck$LassoCheckResult]: Stem: 5597#ULTIMATE.startENTRY 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; 5598#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 5569#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5585#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5586#L56 assume !(~n <= 1); 5680#L59 assume !(2 == ~n); 5679#L62 assume ~n > 2; 5678#L63 assume !(~m <= 1); 5666#L66 call #t~ret6 := multiple_of(~n, ~m);< 5675#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5673#L30 assume !(~m < 0); 5671#L33 assume !(~n < 0); 5670#L36 assume !(0 == ~m); 5668#L39 assume !(0 == ~n); 5612#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5664#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5663#L30 assume !(~m < 0); 5712#L33 assume ~n < 0; 5555#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5692#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5606#L30 assume !(~m < 0); 5552#L33 assume !(~n < 0); 5554#L36 [2018-12-01 22:54:42,512 INFO L796 eck$LassoCheckResult]: Loop: 5554#L36 assume !(0 == ~m); 5582#L39 assume !(0 == ~n); 5574#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5573#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5711#L30 assume !(~m < 0); 5702#L33 assume !(~n < 0); 5554#L36 [2018-12-01 22:54:42,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2018-12-01 22:54:42,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:42,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:54:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:42,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 22:54:42,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/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-12-01 22:54:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:42,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:42,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 22:54:42,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-01 22:54:42,596 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:54:42,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2018-12-01 22:54:42,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:42,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:42,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:42,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:42,645 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:42,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:42,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:42,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:42,646 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 22:54:42,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:42,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:42,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:42,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-12-01 22:54:42,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:42,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:42,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:42,692 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:42,692 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:42,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:42,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:42,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 22:54:42,696 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_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:42,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 22:54:42,710 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:42,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 22:54:42,728 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 22:54:44,010 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 22:54:44,011 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:54:44,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:54:44,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:54:44,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:54:44,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:54:44,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:54:44,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:54:44,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:54:44,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-12-01 22:54:44,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:54:44,012 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:54:44,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:44,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:44,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:44,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:44,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:54:44,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:54:44,057 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:54:44,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:54:44,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:54:44,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:54:44,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:54:44,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:54:44,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:54:44,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:54:44,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:54:44,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:54:44,061 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:54:44,062 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:54:44,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:54:44,062 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 22:54:44,062 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:54:44,062 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2018-12-01 22:54:44,062 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 22:54:44,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:44,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:44,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:44,130 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 22:54:44,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-12-01 22:54:44,191 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2018-12-01 22:54:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:54:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-01 22:54:44,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-01 22:54:44,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:44,191 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 22:54:44,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:44,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:44,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:44,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 22:54:44,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-12-01 22:54:44,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2018-12-01 22:54:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:54:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-01 22:54:44,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-01 22:54:44,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:44,306 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 22:54:44,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:44,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:54:44,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:54:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:54:44,366 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 22:54:44,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-12-01 22:54:44,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 265 states and 319 transitions. Complement of second has 16 states. [2018-12-01 22:54:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-01 22:54:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:54:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-12-01 22:54:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-01 22:54:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2018-12-01 22:54:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2018-12-01 22:54:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:54:44,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2018-12-01 22:54:44,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-01 22:54:44,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2018-12-01 22:54:44,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-01 22:54:44,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-12-01 22:54:44,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2018-12-01 22:54:44,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:44,440 INFO L705 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2018-12-01 22:54:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2018-12-01 22:54:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2018-12-01 22:54:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-01 22:54:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2018-12-01 22:54:44,443 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2018-12-01 22:54:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 22:54:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:54:44,443 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2018-12-01 22:54:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:54:44,501 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-12-01 22:54:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 22:54:44,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2018-12-01 22:54:44,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-01 22:54:44,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2018-12-01 22:54:44,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-12-01 22:54:44,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-01 22:54:44,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2018-12-01 22:54:44,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:54:44,503 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2018-12-01 22:54:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2018-12-01 22:54:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2018-12-01 22:54:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-01 22:54:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2018-12-01 22:54:44,507 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-12-01 22:54:44,507 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-12-01 22:54:44,507 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 22:54:44,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2018-12-01 22:54:44,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-01 22:54:44,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:54:44,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:54:44,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:44,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-01 22:54:44,509 INFO L794 eck$LassoCheckResult]: Stem: 7271#ULTIMATE.startENTRY 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; 7272#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);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; 7234#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7258#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7259#L56 assume !(~n <= 1); 7280#L59 assume !(2 == ~n); 7264#L62 assume ~n > 2; 7265#L63 assume !(~m <= 1); 7252#L66 call #t~ret6 := multiple_of(~n, ~m);< 7283#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7276#L30 assume !(~m < 0); 7277#L33 assume !(~n < 0); 7251#L36 assume !(0 == ~m); 7253#L39 assume !(0 == ~n); 7269#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7335#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7334#L30 assume !(~m < 0); 7333#L33 assume !(~n < 0); 7330#L36 assume !(0 == ~m); 7268#L39 assume !(0 == ~n); 7242#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7289#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7319#L30 assume !(~m < 0); 7317#L33 assume ~n < 0; 7241#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7243#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7326#L30 assume !(~m < 0); 7325#L33 assume !(~n < 0); 7314#L36 [2018-12-01 22:54:44,509 INFO L796 eck$LassoCheckResult]: Loop: 7314#L36 assume !(0 == ~m); 7322#L39 assume !(0 == ~n); 7301#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7320#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7318#L30 assume !(~m < 0); 7300#L33 assume ~n < 0; 7302#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7316#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7315#L30 assume !(~m < 0); 7313#L33 assume !(~n < 0); 7314#L36 [2018-12-01 22:54:44,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2018-12-01 22:54:44,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:44,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:44,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:54:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:44,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2018-12-01 22:54:44,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:44,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:44,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:54:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:44,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:54:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2018-12-01 22:54:44,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:54:44,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:54:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:44,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:54:44,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:54:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:54:44,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 10:54:44 BoogieIcfgContainer [2018-12-01 22:54:44,911 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 22:54:44,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:54:44,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:54:44,911 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:54:44,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:54:36" (3/4) ... [2018-12-01 22:54:44,913 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-01 22:54:44,938 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b8f81222-9a6a-4dde-92ad-249591060d71/bin-2019/uautomizer/witness.graphml [2018-12-01 22:54:44,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:54:44,938 INFO L168 Benchmark]: Toolchain (without parser) took 8690.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2018-12-01 22:54:44,939 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:54:44,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.82 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 941.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:54:44,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-01 22:54:44,940 INFO L168 Benchmark]: Boogie Preprocessor took 11.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:54:44,940 INFO L168 Benchmark]: RCFGBuilder took 165.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:54:44,940 INFO L168 Benchmark]: BuchiAutomizer took 8307.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.5 MB). Peak memory consumption was 300.0 MB. Max. memory is 11.5 GB. [2018-12-01 22:54:44,940 INFO L168 Benchmark]: Witness Printer took 26.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:54:44,942 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.82 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 941.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 165.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8307.15 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.5 MB). Peak memory consumption was 300.0 MB. Max. memory is 11.5 GB. * Witness Printer took 26.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 6.2s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 300 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 259 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 694 SDtfs, 704 SDslu, 1147 SDs, 0 SdLazy, 884 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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: 4ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.8s - 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@4499e1a=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3181cac2=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f54c8e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dc531ec=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@230eed19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d9e1b26=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@670456ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57c00667=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@686da078=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@216609c3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31b4edf4=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@d547fe2=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) [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...