./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-91b1670 [2018-11-29 00:01:55,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:01:55,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:01:55,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:01:55,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:01:55,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:01:55,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:01:55,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:01:55,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:01:55,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:01:55,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:01:55,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:01:55,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:01:55,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:01:55,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:01:55,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:01:55,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:01:55,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:01:55,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:01:55,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:01:55,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:01:55,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:01:55,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:01:55,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:01:55,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:01:55,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:01:55,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:01:55,902 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:01:55,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:01:55,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:01:55,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:01:55,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:01:55,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:01:55,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:01:55,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:01:55,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:01:55,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:01:55,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:01:55,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:01:55,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:01:55,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:01:55,930 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:01:55,930 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:01:55,931 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:01:55,931 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:01:55,931 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:01:55,932 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:01:55,932 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:01:55,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:01:55,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:01:55,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:01:55,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:01:55,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:01:55,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:01:55,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:01:55,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:01:55,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:01:55,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:01:55,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:01:55,936 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:01:55,936 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:01:55,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:01:55,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:01:55,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:01:55,936 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:01:55,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:01:55,937 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:01:55,937 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:01:55,939 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:01:55,939 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82151ec4435da78821025b3100fe51201edc8f02 [2018-11-29 00:01:55,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:01:55,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:01:55,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:01:55,994 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:01:55,994 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:01:55,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-29 00:01:56,071 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ff1174e/2b0e8b4f313845fc909428003c72742e/FLAGb7c5111bd [2018-11-29 00:01:56,554 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:01:56,555 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-29 00:01:56,563 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ff1174e/2b0e8b4f313845fc909428003c72742e/FLAGb7c5111bd [2018-11-29 00:01:56,891 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ff1174e/2b0e8b4f313845fc909428003c72742e [2018-11-29 00:01:56,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:01:56,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:01:56,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:01:56,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:01:56,905 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:01:56,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:01:56" (1/1) ... [2018-11-29 00:01:56,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a111ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:56, skipping insertion in model container [2018-11-29 00:01:56,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:01:56" (1/1) ... [2018-11-29 00:01:56,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:01:56,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:01:57,206 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:01:57,214 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:01:57,251 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:01:57,271 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:01:57,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57 WrapperNode [2018-11-29 00:01:57,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:01:57,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:01:57,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:01:57,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:01:57,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:01:57,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:01:57,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:01:57,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:01:57,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... [2018-11-29 00:01:57,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:01:57,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:01:57,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:01:57,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:01:57,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:01:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2018-11-29 00:01:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2018-11-29 00:01:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-29 00:01:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-29 00:01:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:01:57,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:01:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2018-11-29 00:01:57,485 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2018-11-29 00:01:58,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:01:58,009 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-29 00:01:58,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:58 BoogieIcfgContainer [2018-11-29 00:01:58,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:01:58,011 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:01:58,011 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:01:58,014 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:01:58,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:01:58,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:01:56" (1/3) ... [2018-11-29 00:01:58,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@590c42c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:01:58, skipping insertion in model container [2018-11-29 00:01:58,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:01:58,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:57" (2/3) ... [2018-11-29 00:01:58,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@590c42c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:01:58, skipping insertion in model container [2018-11-29 00:01:58,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:01:58,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:58" (3/3) ... [2018-11-29 00:01:58,019 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-29 00:01:58,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:01:58,082 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:01:58,082 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:01:58,082 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:01:58,083 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:01:58,083 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:01:58,083 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:01:58,083 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:01:58,083 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:01:58,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-29 00:01:58,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-29 00:01:58,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:01:58,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:01:58,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:01:58,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:01:58,148 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:01:58,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-29 00:01:58,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-29 00:01:58,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:01:58,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:01:58,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:01:58,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:01:58,166 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-11-29 00:01:58,167 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-11-29 00:01:58,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2018-11-29 00:01:58,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:01:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:58,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2018-11-29 00:01:58,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:58,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:01:58,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:01:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:01:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:01:58,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:01:58,461 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:01:58,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:01:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:01:58,480 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-29 00:01:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:01:58,857 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-11-29 00:01:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:01:58,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2018-11-29 00:01:58,866 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-29 00:01:58,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2018-11-29 00:01:58,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-29 00:01:58,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-29 00:01:58,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-11-29 00:01:58,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:01:58,880 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-29 00:01:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-11-29 00:01:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-29 00:01:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-29 00:01:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-29 00:01:58,920 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-11-29 00:01:58,920 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-11-29 00:01:58,920 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:01:58,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2018-11-29 00:01:58,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-29 00:01:58,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:01:58,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:01:58,923 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:01:58,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:01:58,923 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-11-29 00:01:58,923 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-11-29 00:01:58,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2018-11-29 00:01:58,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:01:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:58,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2018-11-29 00:01:58,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:01:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:01:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:01:59,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:01:59,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:01:59,070 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:01:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:01:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:01:59,071 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-29 00:01:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:01:59,235 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-11-29 00:01:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:01:59,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-11-29 00:01:59,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-29 00:01:59,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2018-11-29 00:01:59,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-29 00:01:59,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-29 00:01:59,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2018-11-29 00:01:59,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:01:59,246 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2018-11-29 00:01:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2018-11-29 00:01:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-29 00:01:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-29 00:01:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-11-29 00:01:59,253 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-29 00:01:59,253 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-29 00:01:59,253 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:01:59,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2018-11-29 00:01:59,255 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-29 00:01:59,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:01:59,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:01:59,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-29 00:01:59,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:01:59,256 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-11-29 00:01:59,257 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-11-29 00:01:59,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2018-11-29 00:01:59,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:59,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:59,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:01:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:59,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:59,269 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2018-11-29 00:01:59,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:59,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:59,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:01:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:01:59,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:01:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2018-11-29 00:01:59,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:01:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:01:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:01:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:01:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:01:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:01:59,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:01:59,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:01:59,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:01:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:01:59,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:01:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:01:59,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:01:59,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-29 00:02:00,132 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-29 00:02:00,391 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-29 00:02:00,594 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-11-29 00:02:00,671 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:00,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:00,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:00,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:00,672 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:00,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:00,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:00,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:00,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-29 00:02:00,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:00,675 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:00,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:00,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:00,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:00,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:00,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:00,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:00,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:00,846 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:00,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:00,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:00,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:00,875 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:00,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:00,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:00,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:00,900 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:02:00,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:00,940 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:00,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:00,955 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:02:00,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:00,999 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:01,012 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:01,012 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:01,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:01,051 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:01,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:01,106 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:01,166 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:01,168 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:01,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:01,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:01,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:01,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:01,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:01,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:01,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:01,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-29 00:02:01,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:01,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:01,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:01,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:01,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:01,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:01,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:01,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:01,367 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:01,372 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:01,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:01,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:01,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:01,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:01,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:01,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:01,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:01,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:01,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:01,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:01,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:01,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:01,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:01,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:01,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:01,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:01,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:01,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:01,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:01,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:01,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:01,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:01,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:01,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:01,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:01,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:01,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:01,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:01,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:01,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:01,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:01,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:01,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:01,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:01,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:01,398 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:01,415 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-29 00:02:01,416 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:02:01,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:01,418 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:01,419 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:01,419 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2018-11-29 00:02:01,420 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:01,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:01,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:01,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:02:01,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-29 00:02:01,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-29 00:02:02,218 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:02:02,881 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-11-29 00:02:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-29 00:02:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-29 00:02:02,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2018-11-29 00:02:02,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:02,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2018-11-29 00:02:02,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:02,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2018-11-29 00:02:02,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:02,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2018-11-29 00:02:02,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-29 00:02:02,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2018-11-29 00:02:02,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-29 00:02:02,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-29 00:02:02,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2018-11-29 00:02:02,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:02,908 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2018-11-29 00:02:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2018-11-29 00:02:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2018-11-29 00:02:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-29 00:02:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2018-11-29 00:02:02,925 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2018-11-29 00:02:02,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:02:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:02:02,925 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 9 states. [2018-11-29 00:02:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:03,215 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2018-11-29 00:02:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-29 00:02:03,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2018-11-29 00:02:03,222 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-29 00:02:03,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2018-11-29 00:02:03,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-29 00:02:03,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-29 00:02:03,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2018-11-29 00:02:03,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:03,228 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2018-11-29 00:02:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2018-11-29 00:02:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-11-29 00:02:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-29 00:02:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2018-11-29 00:02:03,240 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-29 00:02:03,240 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-29 00:02:03,240 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:02:03,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2018-11-29 00:02:03,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-29 00:02:03,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:03,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:03,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:03,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:03,245 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-11-29 00:02:03,245 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-11-29 00:02:03,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2018-11-29 00:02:03,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:03,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:03,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:03,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:03,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:03,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:03,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:02:03,285 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:03,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2018-11-29 00:02:03,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:03,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:03,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:03,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:03,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:03,401 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:03,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:03,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:03,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:03,402 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:03,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:03,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:03,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-29 00:02:03,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:03,402 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:03,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:03,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:03,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:03,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:03,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:03,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:03,484 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:03,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:03,492 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:03,492 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:03,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:03,529 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:03,529 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:03,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:03,553 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:03,553 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:03,575 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:03,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:03,579 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:03,604 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:03,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:03,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:04,404 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:04,407 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:04,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:04,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:04,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:04,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:04,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:04,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:04,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:04,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-29 00:02:04,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:04,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:04,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:04,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:04,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:04,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:04,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:04,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:04,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:04,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:04,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:04,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:04,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:04,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:04,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:04,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:04,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:04,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:04,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:04,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:04,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:04,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:04,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:04,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:04,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:04,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:04,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:04,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:04,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:04,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:04,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:04,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:04,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:04,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:04,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:04,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:04,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:04,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:04,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:04,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:04,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:04,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:04,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:04,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:04,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:04,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:04,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:04,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:04,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:04,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:04,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:04,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:04,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:04,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:04,553 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:04,556 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-29 00:02:04,556 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:04,557 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:04,557 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:04,557 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:04,557 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2018-11-29 00:02:04,557 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:04,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:04,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:04,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:04,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:02:04,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-29 00:02:04,770 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-11-29 00:02:04,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:02:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-29 00:02:04,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-29 00:02:04,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:04,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:02:04,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:04,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-29 00:02:04,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:04,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2018-11-29 00:02:04,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2018-11-29 00:02:04,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2018-11-29 00:02:04,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-29 00:02:04,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-29 00:02:04,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2018-11-29 00:02:04,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:04,784 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2018-11-29 00:02:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2018-11-29 00:02:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-11-29 00:02:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-29 00:02:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2018-11-29 00:02:04,794 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2018-11-29 00:02:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:02:04,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:02:04,795 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2018-11-29 00:02:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:05,043 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-29 00:02:05,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:02:05,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2018-11-29 00:02:05,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:05,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2018-11-29 00:02:05,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-29 00:02:05,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-29 00:02:05,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2018-11-29 00:02:05,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:05,060 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2018-11-29 00:02:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2018-11-29 00:02:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-11-29 00:02:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-29 00:02:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-11-29 00:02:05,079 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-29 00:02:05,079 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-29 00:02:05,079 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:02:05,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2018-11-29 00:02:05,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:05,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:05,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:05,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:05,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:05,089 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-11-29 00:02:05,089 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-11-29 00:02:05,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2018-11-29 00:02:05,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:05,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:05,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:05,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:05,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:05,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-29 00:02:05,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:05,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2018-11-29 00:02:05,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:05,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:05,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:05,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:05,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:05,319 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:05,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:05,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:05,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:05,319 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:05,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:05,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:05,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-29 00:02:05,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:05,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:05,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,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-11-29 00:02:05,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,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-11-29 00:02:05,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,462 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:05,462 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:05,469 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:05,495 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:05,519 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,539 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:05,542 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,565 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:05,567 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:05,591 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:05,613 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:05,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:05,661 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:05,662 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:05,662 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:05,662 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:05,662 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:05,663 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:05,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:05,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:05,663 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:05,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-29 00:02:05,663 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:05,663 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:05,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:05,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:05,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:05,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:05,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:05,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:05,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:05,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:05,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:05,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:05,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:05,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:05,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:05,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:05,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:05,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:05,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:05,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:05,740 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-29 00:02:05,740 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:05,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:05,741 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:05,748 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:05,748 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2018-11-29 00:02:05,748 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:05,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:05,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:05,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:05,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:05,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2018-11-29 00:02:06,049 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-11-29 00:02:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-29 00:02:06,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-29 00:02:06,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:06,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-29 00:02:06,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:06,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-29 00:02:06,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:06,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2018-11-29 00:02:06,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:06,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2018-11-29 00:02:06,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-29 00:02:06,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-29 00:02:06,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2018-11-29 00:02:06,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:06,064 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2018-11-29 00:02:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2018-11-29 00:02:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-11-29 00:02:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-29 00:02:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2018-11-29 00:02:06,079 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2018-11-29 00:02:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:02:06,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:02:06,082 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2018-11-29 00:02:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:06,368 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2018-11-29 00:02:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:02:06,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2018-11-29 00:02:06,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:06,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2018-11-29 00:02:06,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-29 00:02:06,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-29 00:02:06,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2018-11-29 00:02:06,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:06,375 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-29 00:02:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2018-11-29 00:02:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-29 00:02:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-29 00:02:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2018-11-29 00:02:06,381 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-11-29 00:02:06,381 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-11-29 00:02:06,381 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:02:06,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2018-11-29 00:02:06,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:06,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:06,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:06,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:06,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:02:06,383 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-11-29 00:02:06,383 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-11-29 00:02:06,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2018-11-29 00:02:06,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:06,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:06,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:06,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:06,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:06,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:06,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-29 00:02:06,507 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:06,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2018-11-29 00:02:06,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:06,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:06,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:06,667 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:02:06,675 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:06,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:06,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:06,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:06,676 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:06,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:06,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:06,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-29 00:02:06,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:06,676 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:06,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:06,813 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:06,823 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:06,826 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:06,826 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:06,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:06,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:06,849 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:06,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:06,874 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:06,874 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:06,897 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:06,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:06,947 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:06,948 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:06,949 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:06,949 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:06,949 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:06,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:06,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:06,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:06,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:06,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-29 00:02:06,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:06,949 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:06,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:06,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:07,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:07,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:07,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:07,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:07,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:07,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:07,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:07,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:07,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:07,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:07,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:07,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:07,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:07,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:07,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:07,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:07,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:07,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:07,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:07,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:07,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:07,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:07,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:07,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:07,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:07,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:07,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:07,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:07,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:07,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:07,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:07,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:07,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:07,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:07,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:07,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:07,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:07,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:07,030 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-29 00:02:07,030 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:07,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:07,030 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:07,031 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:07,031 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2018-11-29 00:02:07,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:07,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:07,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:07,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:07,213 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:02:07,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-29 00:02:07,286 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-11-29 00:02:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:02:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-29 00:02:07,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-29 00:02:07,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:07,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-29 00:02:07,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:07,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-29 00:02:07,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:07,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2018-11-29 00:02:07,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-29 00:02:07,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2018-11-29 00:02:07,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-29 00:02:07,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-29 00:02:07,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2018-11-29 00:02:07,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:07,318 INFO L705 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2018-11-29 00:02:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2018-11-29 00:02:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2018-11-29 00:02:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-29 00:02:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2018-11-29 00:02:07,337 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2018-11-29 00:02:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:02:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:02:07,339 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2018-11-29 00:02:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:07,641 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2018-11-29 00:02:07,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:02:07,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 279 transitions. [2018-11-29 00:02:07,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-29 00:02:07,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 279 transitions. [2018-11-29 00:02:07,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-29 00:02:07,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-29 00:02:07,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 279 transitions. [2018-11-29 00:02:07,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:07,649 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-29 00:02:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 279 transitions. [2018-11-29 00:02:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-11-29 00:02:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-29 00:02:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2018-11-29 00:02:07,658 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-29 00:02:07,658 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-29 00:02:07,658 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:02:07,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 279 transitions. [2018-11-29 00:02:07,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-29 00:02:07,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:07,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:07,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:07,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:02:07,661 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-11-29 00:02:07,661 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-11-29 00:02:07,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2018-11-29 00:02:07,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:07,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:07,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:07,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:07,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:07,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:07,677 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2018-11-29 00:02:07,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:07,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:07,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:07,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:07,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:07,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2018-11-29 00:02:07,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:07,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:07,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:07,842 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:07,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:07,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:07,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:07,842 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:07,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:07,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:07,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:07,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-29 00:02:07,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:07,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:07,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:07,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:07,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-11-29 00:02:07,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:07,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:07,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:07,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-11-29 00:02:07,948 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:07,950 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:07,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:07,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:07,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:07,978 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:08,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:08,002 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:08,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:08,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:08,131 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:08,133 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:08,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:08,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:08,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:08,134 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:08,134 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:08,134 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:08,134 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:08,134 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-29 00:02:08,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:08,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:08,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,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-11-29 00:02:08,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,264 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:08,264 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:08,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:08,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:08,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:08,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:08,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:08,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:08,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:08,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:08,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:08,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:08,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:08,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:08,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:08,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:08,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:08,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:08,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:08,272 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:08,275 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:08,275 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:08,276 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:08,276 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:08,276 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:08,276 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2018-11-29 00:02:08,276 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:08,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:08,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:08,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:08,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-29 00:02:08,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75 Second operand 6 states. [2018-11-29 00:02:08,595 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-11-29 00:02:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-29 00:02:08,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-29 00:02:08,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:08,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-29 00:02:08,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:08,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2018-11-29 00:02:08,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:08,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 413 transitions. [2018-11-29 00:02:08,603 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-29 00:02:08,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 282 states and 365 transitions. [2018-11-29 00:02:08,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-29 00:02:08,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-29 00:02:08,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 365 transitions. [2018-11-29 00:02:08,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:08,614 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 365 transitions. [2018-11-29 00:02:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 365 transitions. [2018-11-29 00:02:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 249. [2018-11-29 00:02:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-29 00:02:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 323 transitions. [2018-11-29 00:02:08,627 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-11-29 00:02:08,627 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-11-29 00:02:08,627 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:02:08,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 323 transitions. [2018-11-29 00:02:08,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-29 00:02:08,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:08,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:08,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:08,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:02:08,631 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-11-29 00:02:08,631 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-11-29 00:02:08,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2018-11-29 00:02:08,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:08,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:08,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2018-11-29 00:02:08,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:08,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2018-11-29 00:02:08,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:08,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:08,869 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:08,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:08,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:08,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:08,870 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:08,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:08,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:08,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:08,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-29 00:02:08,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:08,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:08,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-11-29 00:02:08,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:08,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:09,133 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-29 00:02:09,180 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:09,181 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:09,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:09,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:09,187 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:09,187 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:09,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:09,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:09,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:09,214 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:09,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:09,236 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:09,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:09,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:10,145 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:10,147 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:10,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:10,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:10,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:10,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:10,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:10,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:10,148 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:10,148 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-29 00:02:10,148 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:10,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:10,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,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-11-29 00:02:10,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,258 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:10,258 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:10,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:10,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:10,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:10,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:10,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:10,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:10,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:10,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:10,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:10,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:10,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:10,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:10,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:10,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:10,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:10,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:10,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:10,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:10,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:10,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:10,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:10,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:10,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:10,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:10,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:10,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:10,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:10,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:10,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:10,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:10,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:10,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:10,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:10,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:10,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:10,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:10,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:10,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:10,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:10,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:10,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:10,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:10,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:10,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:10,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:10,289 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:10,289 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:10,290 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:10,290 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:10,290 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:10,290 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-29 00:02:10,290 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:10,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:10,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:10,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:10,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:10,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86 Second operand 6 states. [2018-11-29 00:02:10,613 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-11-29 00:02:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-29 00:02:10,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-29 00:02:10,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:10,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-29 00:02:10,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:10,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-29 00:02:10,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:10,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 350 transitions. [2018-11-29 00:02:10,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-29 00:02:10,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 272 states and 349 transitions. [2018-11-29 00:02:10,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-29 00:02:10,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-29 00:02:10,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 349 transitions. [2018-11-29 00:02:10,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:10,625 INFO L705 BuchiCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-11-29 00:02:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 349 transitions. [2018-11-29 00:02:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-11-29 00:02:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-29 00:02:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 335 transitions. [2018-11-29 00:02:10,642 INFO L728 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-11-29 00:02:10,642 INFO L608 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-11-29 00:02:10,642 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:02:10,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 335 transitions. [2018-11-29 00:02:10,646 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-29 00:02:10,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:10,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:10,647 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-11-29 00:02:10,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:10,647 INFO L794 eck$LassoCheckResult]: Stem: 4428#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); 4444#L59 assume 2 == ~n;#res := 1; 4443#is_prime_FINAL assume true; 4441#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; 4407#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4408#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); 4401#L22 assume !(1 == ~m); 4409#L25 call #t~ret1 := mult(~n, ~m - 1);< 4590#multENTRY ~n := #in~n;~m := #in~m; 4449#L16 assume ~m < 0; 4369#L17 [2018-11-29 00:02:10,647 INFO L796 eck$LassoCheckResult]: Loop: 4369#L17 call #t~ret0 := mult(~n, -~m);< 4370#multENTRY ~n := #in~n;~m := #in~m; 4450#L16 assume ~m < 0; 4369#L17 [2018-11-29 00:02:10,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2018-11-29 00:02:10,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:10,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:10,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:10,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:02:10,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:10,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2018-11-29 00:02:10,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:10,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:10,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:10,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:10,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:10,809 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:10,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:10,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:10,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:10,810 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:10,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:10,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:10,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:10,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-29 00:02:10,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:10,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:10,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:10,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:10,874 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:02:10,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:10,884 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:10,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:10,896 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:10,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:10,925 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:10,928 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:10,929 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:10,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:10,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:10,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:10,955 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:10,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:10,975 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:11,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:11,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:12,316 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:12,318 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:12,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:12,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:12,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:12,318 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:12,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:12,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:12,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-29 00:02:12,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:12,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:12,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,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-11-29 00:02:12,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:12,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:12,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:12,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:12,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:12,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:12,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:12,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:12,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,395 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:12,396 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-29 00:02:12,396 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:12,397 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:12,397 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:12,397 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:12,397 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-29 00:02:12,397 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:12,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:12,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:12,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:12,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:12,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89 Second operand 5 states. [2018-11-29 00:02:12,636 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-11-29 00:02:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-29 00:02:12,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-29 00:02:12,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:12,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-29 00:02:12,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:12,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-29 00:02:12,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:12,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 381 transitions. [2018-11-29 00:02:12,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-29 00:02:12,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 290 states and 371 transitions. [2018-11-29 00:02:12,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-29 00:02:12,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-29 00:02:12,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 371 transitions. [2018-11-29 00:02:12,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:12,652 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 371 transitions. [2018-11-29 00:02:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 371 transitions. [2018-11-29 00:02:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-11-29 00:02:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-29 00:02:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2018-11-29 00:02:12,665 INFO L728 BuchiCegarLoop]: Abstraction has 277 states and 357 transitions. [2018-11-29 00:02:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:02:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:02:12,665 INFO L87 Difference]: Start difference. First operand 277 states and 357 transitions. Second operand 5 states. [2018-11-29 00:02:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:12,810 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2018-11-29 00:02:12,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:02:12,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 348 transitions. [2018-11-29 00:02:12,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-29 00:02:12,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 196 states and 236 transitions. [2018-11-29 00:02:12,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-29 00:02:12,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-29 00:02:12,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2018-11-29 00:02:12,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:12,817 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2018-11-29 00:02:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2018-11-29 00:02:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2018-11-29 00:02:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-29 00:02:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2018-11-29 00:02:12,823 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-29 00:02:12,823 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-29 00:02:12,823 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:02:12,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2018-11-29 00:02:12,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-29 00:02:12,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:12,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:12,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:12,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:02:12,826 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-11-29 00:02:12,826 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-11-29 00:02:12,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2018-11-29 00:02:12,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:12,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:12,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:12,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:12,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:12,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:12,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:12,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-29 00:02:12,982 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:12,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2018-11-29 00:02:12,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:12,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:12,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:12,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:12,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,081 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:13,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:13,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:13,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:13,082 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:13,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:13,082 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:13,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:13,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-29 00:02:13,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:13,083 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:13,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-11-29 00:02:13,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:13,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:13,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:13,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:13,192 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:13,193 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:13,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:13,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:13,201 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:13,201 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:13,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:13,222 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:13,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:13,248 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:15,116 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:15,118 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:15,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:15,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:15,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:15,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:15,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:15,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:15,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:15,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-29 00:02:15,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:15,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:15,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:15,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:15,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:15,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:15,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:15,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:15,227 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:15,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:15,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:15,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:15,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:15,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:15,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:15,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:15,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:15,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:15,234 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:15,234 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:02:15,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:15,234 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:15,235 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:15,235 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2018-11-29 00:02:15,235 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:15,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:15,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:15,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:16,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-29 00:02:16,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-29 00:02:16,190 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-11-29 00:02:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:16,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-29 00:02:16,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:16,194 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:16,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:16,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:16,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:16,383 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-29 00:02:16,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-29 00:02:16,600 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-11-29 00:02:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-29 00:02:16,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-29 00:02:16,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:16,602 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:16,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:16,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:16,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:16,758 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-29 00:02:16,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-29 00:02:16,943 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-11-29 00:02:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-29 00:02:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-29 00:02:16,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-29 00:02:16,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:16,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2018-11-29 00:02:16,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:16,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2018-11-29 00:02:16,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:16,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2018-11-29 00:02:16,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-29 00:02:16,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2018-11-29 00:02:16,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-29 00:02:16,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-29 00:02:16,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2018-11-29 00:02:16,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:16,964 INFO L705 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2018-11-29 00:02:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2018-11-29 00:02:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2018-11-29 00:02:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-29 00:02:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2018-11-29 00:02:16,977 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2018-11-29 00:02:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:02:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:02:16,981 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2018-11-29 00:02:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:17,419 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-11-29 00:02:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:02:17,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2018-11-29 00:02:17,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-29 00:02:17,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2018-11-29 00:02:17,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-29 00:02:17,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-29 00:02:17,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2018-11-29 00:02:17,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:17,427 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2018-11-29 00:02:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2018-11-29 00:02:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2018-11-29 00:02:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-29 00:02:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2018-11-29 00:02:17,438 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-11-29 00:02:17,439 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-11-29 00:02:17,439 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:02:17,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2018-11-29 00:02:17,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-29 00:02:17,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:17,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:17,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:17,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:17,447 INFO L794 eck$LassoCheckResult]: Stem: 7270#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; 7271#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);< 7256#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7257#L56 assume !(~n <= 1); 7278#L59 assume !(2 == ~n); 7262#L62 assume ~n > 2; 7263#L63 assume !(~m <= 1); 7252#L66 call #t~ret6 := multiple_of(~n, ~m);< 7282#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7275#L30 assume !(~m < 0); 7276#L33 assume !(~n < 0); 7251#L36 assume !(0 == ~m); 7253#L39 assume !(0 == ~n); 7267#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7334#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7333#L30 assume !(~m < 0); 7332#L33 assume !(~n < 0); 7329#L36 assume !(0 == ~m); 7266#L39 assume !(0 == ~n); 7242#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7288#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7318#L30 assume !(~m < 0); 7316#L33 assume ~n < 0; 7241#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7243#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7325#L30 assume !(~m < 0); 7324#L33 assume !(~n < 0); 7313#L36 [2018-11-29 00:02:17,447 INFO L796 eck$LassoCheckResult]: Loop: 7313#L36 assume !(0 == ~m); 7321#L39 assume !(0 == ~n); 7300#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7319#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7317#L30 assume !(~m < 0); 7299#L33 assume ~n < 0; 7301#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7315#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7314#L30 assume !(~m < 0); 7312#L33 assume !(~n < 0); 7313#L36 [2018-11-29 00:02:17,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2018-11-29 00:02:17,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:17,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:17,471 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2018-11-29 00:02:17,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:17,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2018-11-29 00:02:17,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:17,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:17,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:17,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:17,630 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:02:18,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:02:18 BoogieIcfgContainer [2018-11-29 00:02:18,458 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:02:18,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:02:18,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:02:18,458 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:02:18,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:58" (3/4) ... [2018-11-29 00:02:18,462 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:02:18,541 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:02:18,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:02:18,544 INFO L168 Benchmark]: Toolchain (without parser) took 21647.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 114.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:02:18,545 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:02:18,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.55 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:02:18,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.43 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:02:18,546 INFO L168 Benchmark]: Boogie Preprocessor took 35.17 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:02:18,550 INFO L168 Benchmark]: RCFGBuilder took 658.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:02:18,550 INFO L168 Benchmark]: BuchiAutomizer took 20446.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.9 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:02:18,551 INFO L168 Benchmark]: Witness Printer took 83.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-29 00:02:18,557 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.55 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.43 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.17 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20446.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.9 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. * Witness Printer took 83.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 20.3s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 12.7s. Construction of modules took 2.5s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 300 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s 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, 2.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: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.5s - 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@6594d8bd=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ce9e9dc=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61081ea7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65bd65d0=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fc06eda=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ba1174c=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@668651dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37d0f0c1=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50a6c0af=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fbb415c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@707cbf0a=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5bafd1b7=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...