./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82151ec4435da78821025b3100fe51201edc8f02 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:11:24,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:24,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:24,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:24,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:24,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:24,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:24,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:24,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:24,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:24,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:24,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:24,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:24,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:24,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:24,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:24,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:24,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:24,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:24,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:24,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:24,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:24,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:24,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:24,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:24,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:24,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:24,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:24,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:24,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:24,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:24,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:24,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:24,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:24,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:24,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:24,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:24,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:24,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:24,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:24,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:24,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:11:24,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:24,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:24,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:24,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:24,289 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:24,289 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:11:24,289 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:11:24,289 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:11:24,290 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:11:24,290 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:11:24,290 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:11:24,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:24,291 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:11:24,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:11:24,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:11:24,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:11:24,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:24,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:11:24,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:11:24,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:11:24,293 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:11:24,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:11:24,294 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:11:24,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:24,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:11:24,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:24,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:24,296 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:11:24,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:24,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:11:24,298 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:11:24,299 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:11:24,301 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82151ec4435da78821025b3100fe51201edc8f02 [2019-11-16 00:11:24,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:24,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:24,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:24,361 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:24,362 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:24,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/../../sv-benchmarks/c/recursive/Primes.c [2019-11-16 00:11:24,435 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/data/fc39f5b3e/b15391799ba64c6e8a0f1932534a83f4/FLAG1946b2f69 [2019-11-16 00:11:24,860 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:24,863 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/sv-benchmarks/c/recursive/Primes.c [2019-11-16 00:11:24,871 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/data/fc39f5b3e/b15391799ba64c6e8a0f1932534a83f4/FLAG1946b2f69 [2019-11-16 00:11:25,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/data/fc39f5b3e/b15391799ba64c6e8a0f1932534a83f4 [2019-11-16 00:11:25,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:25,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:11:25,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:25,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:25,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:25,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aab26d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25, skipping insertion in model container [2019-11-16 00:11:25,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,243 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:25,268 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:25,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:25,575 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:25,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:25,629 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:25,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25 WrapperNode [2019-11-16 00:11:25,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:25,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:25,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:11:25,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:11:25,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:25,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:25,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:25,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:25,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... [2019-11-16 00:11:25,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:25,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:25,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:25,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:25,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:25,764 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-11-16 00:11:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-11-16 00:11:25,764 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-11-16 00:11:25,764 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-11-16 00:11:25,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:25,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:25,766 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-11-16 00:11:25,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-11-16 00:11:26,122 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:26,123 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:11:26,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:26 BoogieIcfgContainer [2019-11-16 00:11:26,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:26,125 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:11:26,125 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:11:26,129 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:11:26,130 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:11:26,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:11:25" (1/3) ... [2019-11-16 00:11:26,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ebc5500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:11:26, skipping insertion in model container [2019-11-16 00:11:26,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:11:26,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:25" (2/3) ... [2019-11-16 00:11:26,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ebc5500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:11:26, skipping insertion in model container [2019-11-16 00:11:26,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:11:26,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:26" (3/3) ... [2019-11-16 00:11:26,134 INFO L371 chiAutomizerObserver]: Analyzing ICFG Primes.c [2019-11-16 00:11:26,188 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:11:26,189 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:11:26,189 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:11:26,189 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:26,189 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:26,189 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:11:26,189 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:26,189 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:11:26,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2019-11-16 00:11:26,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:11:26,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:26,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:26,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:11:26,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:26,265 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:11:26,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2019-11-16 00:11:26,271 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:11:26,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:26,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:26,272 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:11:26,272 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:26,280 INFO L791 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 [2019-11-16 00:11:26,280 INFO L793 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 [2019-11-16 00:11:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2019-11-16 00:11:26,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:26,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376446869] [2019-11-16 00:11:26,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:26,385 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2019-11-16 00:11:26,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:26,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013074725] [2019-11-16 00:11:26,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:26,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013074725] [2019-11-16 00:11:26,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:26,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:11:26,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940674630] [2019-11-16 00:11:26,504 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:11:26,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:11:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:11:26,521 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2019-11-16 00:11:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:26,682 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2019-11-16 00:11:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:11:26,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2019-11-16 00:11:26,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:11:26,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2019-11-16 00:11:26,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-16 00:11:26,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-16 00:11:26,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2019-11-16 00:11:26,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:11:26,710 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-11-16 00:11:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2019-11-16 00:11:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-16 00:11:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-16 00:11:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-11-16 00:11:26,764 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-16 00:11:26,764 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-16 00:11:26,765 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:11:26,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-11-16 00:11:26,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:11:26,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:26,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:26,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:11:26,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:26,768 INFO L791 eck$LassoCheckResult]: Stem: 158#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; 149#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; 138#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 146#is_prime_ENTRY [2019-11-16 00:11:26,769 INFO L793 eck$LassoCheckResult]: Loop: 146#is_prime_ENTRY ~n := #in~n;~m := #in~m; 147#L56 assume !(~n <= 1); 137#L59 assume !(2 == ~n); 141#L62 assume ~n > 2; 148#L63 assume !(~m <= 1); 124#L66 call #t~ret6 := multiple_of(~n, ~m);< 134#multiple_ofENTRY ~n := #in~n;~m := #in~m; 159#L30 assume !(~m < 0); 155#L33 assume !(~n < 0); 144#L36 assume !(0 == ~m); 145#L39 assume 0 == ~n;#res := 1; 128#multiple_ofFINAL assume true; 156#multiple_ofEXIT >#121#return; 157#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 139#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 146#is_prime_ENTRY [2019-11-16 00:11:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2019-11-16 00:11:26,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:26,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692472036] [2019-11-16 00:11:26,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:26,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2019-11-16 00:11:26,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:26,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978912524] [2019-11-16 00:11:26,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:26,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978912524] [2019-11-16 00:11:26,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:26,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:11:26,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955490143] [2019-11-16 00:11:26,840 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:11:26,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:11:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:11:26,841 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-16 00:11:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:26,959 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-11-16 00:11:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:11:26,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-11-16 00:11:26,965 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:11:26,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2019-11-16 00:11:26,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-16 00:11:26,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-16 00:11:26,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2019-11-16 00:11:26,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:11:26,969 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-11-16 00:11:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2019-11-16 00:11:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-16 00:11:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:11:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-11-16 00:11:26,975 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-11-16 00:11:26,975 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-11-16 00:11:26,975 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:11:26,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2019-11-16 00:11:26,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:11:26,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:26,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:26,979 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:11:26,979 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:26,979 INFO L791 eck$LassoCheckResult]: Stem: 255#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; 246#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; 235#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 243#is_prime_ENTRY [2019-11-16 00:11:26,979 INFO L793 eck$LassoCheckResult]: Loop: 243#is_prime_ENTRY ~n := #in~n;~m := #in~m; 244#L56 assume !(~n <= 1); 234#L59 assume !(2 == ~n); 238#L62 assume ~n > 2; 245#L63 assume !(~m <= 1); 223#L66 call #t~ret6 := multiple_of(~n, ~m);< 231#multiple_ofENTRY ~n := #in~n;~m := #in~m; 257#L30 assume !(~m < 0); 253#L33 assume !(~n < 0); 241#L36 assume !(0 == ~m); 242#L39 assume !(0 == ~n); 224#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 231#multiple_ofENTRY ~n := #in~n;~m := #in~m; 257#L30 assume !(~m < 0); 253#L33 assume !(~n < 0); 241#L36 assume !(0 == ~m); 242#L39 assume 0 == ~n;#res := 1; 225#multiple_ofFINAL assume true; 254#multiple_ofEXIT >#111#return; 247#L42-1 #res := #t~ret4;havoc #t~ret4; 248#multiple_ofFINAL assume true; 259#multiple_ofEXIT >#121#return; 256#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 236#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 243#is_prime_ENTRY [2019-11-16 00:11:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2019-11-16 00:11:26,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:26,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939387844] [2019-11-16 00:11:26,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:26,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2019-11-16 00:11:26,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:26,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209620952] [2019-11-16 00:11:26,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:26,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:27,032 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2019-11-16 00:11:27,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:27,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934599058] [2019-11-16 00:11:27,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:27,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:27,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:27,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934599058] [2019-11-16 00:11:27,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762569187] [2019-11-16 00:11:27,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:27,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:11:27,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:27,402 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:27,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-16 00:11:27,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167629810] [2019-11-16 00:11:27,806 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:27,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:27,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:27,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:27,808 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:27,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:27,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:27,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:27,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2019-11-16 00:11:27,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:27,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:27,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:27,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:27,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:27,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:27,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:27,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:27,921 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:27,922 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:27,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:27,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:27,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:27,948 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:27,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:27,965 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:27,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:27,970 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:27,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:27,991 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:27,997 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:27,997 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret6=0} Honda state: {is_prime__#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:28,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:28,013 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:28,030 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:28,031 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret7=0} Honda state: {is_prime__#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:28,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:28,055 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:28,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:28,080 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:28,195 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:28,198 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:28,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:28,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:28,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:28,198 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:28,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:28,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:28,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:28,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2019-11-16 00:11:28,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:28,199 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:28,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:28,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:28,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:28,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:28,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:28,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:28,325 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:28,331 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:28,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:28,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:28,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:28,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:28,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:28,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:28,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:28,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:28,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:28,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:28,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:28,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:28,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:28,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:28,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:28,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:28,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:28,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:28,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:28,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:28,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:28,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:28,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:28,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:28,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:28,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:28,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:28,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:28,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:28,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:28,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:28,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:28,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:28,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:28,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:28,396 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:28,408 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:11:28,408 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:11:28,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:28,411 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:28,411 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:28,412 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2019-11-16 00:11:28,414 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:28,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:11:28,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:28,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:11:28,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:11:28,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-11-16 00:11:28,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-11-16 00:11:29,232 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. [2019-11-16 00:11:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:11:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2019-11-16 00:11:29,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2019-11-16 00:11:29,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:29,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2019-11-16 00:11:29,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:29,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2019-11-16 00:11:29,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:29,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2019-11-16 00:11:29,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2019-11-16 00:11:29,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2019-11-16 00:11:29,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-11-16 00:11:29,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-11-16 00:11:29,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2019-11-16 00:11:29,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:29,256 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2019-11-16 00:11:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2019-11-16 00:11:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2019-11-16 00:11:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-16 00:11:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2019-11-16 00:11:29,273 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2019-11-16 00:11:29,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:11:29,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:11:29,275 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 10 states. [2019-11-16 00:11:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:29,538 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2019-11-16 00:11:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:11:29,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2019-11-16 00:11:29,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-16 00:11:29,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2019-11-16 00:11:29,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-11-16 00:11:29,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-16 00:11:29,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2019-11-16 00:11:29,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:29,561 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2019-11-16 00:11:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2019-11-16 00:11:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2019-11-16 00:11:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-16 00:11:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2019-11-16 00:11:29,601 INFO L711 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-11-16 00:11:29,601 INFO L591 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-11-16 00:11:29,601 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:11:29,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2019-11-16 00:11:29,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-11-16 00:11:29,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:29,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:29,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:29,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:11:29,604 INFO L791 eck$LassoCheckResult]: Stem: 1023#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; 1002#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; 979#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 994#is_prime_ENTRY ~n := #in~n;~m := #in~m; 996#L56 assume !(~n <= 1); 978#L59 assume !(2 == ~n); 981#L62 assume ~n > 2; 999#L63 assume !(~m <= 1); 972#L66 call #t~ret6 := multiple_of(~n, ~m);< 1031#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1059#L30 assume ~m < 0; 1006#L31 [2019-11-16 00:11:29,604 INFO L793 eck$LassoCheckResult]: Loop: 1006#L31 call #t~ret2 := multiple_of(~n, -~m);< 1010#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1027#L30 assume ~m < 0; 1006#L31 [2019-11-16 00:11:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2019-11-16 00:11:29,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:29,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627520591] [2019-11-16 00:11:29,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:29,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:29,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:29,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627520591] [2019-11-16 00:11:29,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:29,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:11:29,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942596331] [2019-11-16 00:11:29,638 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2019-11-16 00:11:29,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:29,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311315117] [2019-11-16 00:11:29,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:29,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:29,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:29,645 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:29,704 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:29,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:29,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:29,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:29,704 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:29,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:29,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:29,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:29,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2019-11-16 00:11:29,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:29,705 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:29,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:29,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:29,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:29,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:29,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:29,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:29,779 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:29,779 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:29,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:29,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:29,788 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:29,788 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret4=0} Honda state: {multiple_of_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:29,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:29,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:29,798 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:29,799 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0, multiple_of_#in~n=0} Honda state: {multiple_of_~n=0, multiple_of_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:29,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:29,815 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:29,822 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:29,822 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:29,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:29,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:29,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:29,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:29,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:29,863 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:29,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:29,891 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:31,554 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:31,556 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:31,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:31,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:31,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:31,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:31,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:31,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:31,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:31,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2019-11-16 00:11:31,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:31,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:31,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:31,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:31,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:31,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:31,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:31,622 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:31,622 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:31,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:31,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:31,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:31,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:31,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:31,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:31,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:31,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:31,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:31,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:31,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:31,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:31,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:31,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:31,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:31,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:31,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:31,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:31,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:31,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:31,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:31,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:31,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:31,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:31,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:31,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:31,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:31,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:31,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:31,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:31,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:31,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:31,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:31,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:31,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:31,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:31,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:31,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:31,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:31,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:31,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:31,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:31,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:31,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:31,644 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:31,647 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:11:31,647 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:11:31,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:31,648 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:31,648 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:31,648 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2019-11-16 00:11:31,649 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:31,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:11:31,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:31,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:11:31,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:31,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:11:31,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2019-11-16 00:11:31,825 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. [2019-11-16 00:11:31,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:11:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2019-11-16 00:11:31,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-16 00:11:31,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:31,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-16 00:11:31,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:31,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-16 00:11:31,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:31,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2019-11-16 00:11:31,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2019-11-16 00:11:31,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2019-11-16 00:11:31,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-11-16 00:11:31,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-11-16 00:11:31,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2019-11-16 00:11:31,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:31,857 INFO L688 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2019-11-16 00:11:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2019-11-16 00:11:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2019-11-16 00:11:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:11:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2019-11-16 00:11:31,878 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2019-11-16 00:11:31,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:11:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:11:31,878 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2019-11-16 00:11:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:31,933 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2019-11-16 00:11:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:11:31,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2019-11-16 00:11:31,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:11:31,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2019-11-16 00:11:31,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2019-11-16 00:11:31,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2019-11-16 00:11:31,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2019-11-16 00:11:31,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:31,947 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-11-16 00:11:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2019-11-16 00:11:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-16 00:11:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:11:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2019-11-16 00:11:31,963 INFO L711 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-11-16 00:11:31,963 INFO L591 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-11-16 00:11:31,963 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:11:31,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2019-11-16 00:11:31,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:11:31,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:31,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:31,972 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:31,972 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:11:31,972 INFO L791 eck$LassoCheckResult]: Stem: 1660#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; 1642#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; 1626#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1634#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1636#L56 assume ~n <= 1;#res := 0; 1707#is_prime_FINAL assume true; 1668#is_prime_EXIT >#117#return; 1629#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1619#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; 1620#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1652#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 1653#L95 assume main_#t~short13; 1612#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1628#multENTRY [2019-11-16 00:11:31,972 INFO L793 eck$LassoCheckResult]: Loop: 1628#multENTRY ~n := #in~n;~m := #in~m; 1610#L16 assume ~m < 0; 1613#L17 call #t~ret0 := mult(~n, -~m);< 1628#multENTRY [2019-11-16 00:11:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2019-11-16 00:11:31,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:31,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654146475] [2019-11-16 00:11:31,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:31,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:31,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:32,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654146475] [2019-11-16 00:11:32,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:32,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:11:32,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775190635] [2019-11-16 00:11:32,049 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2019-11-16 00:11:32,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:32,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731306897] [2019-11-16 00:11:32,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:32,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:32,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:32,066 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:32,127 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:32,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:32,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:32,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:32,128 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:32,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:32,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:32,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2019-11-16 00:11:32,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:32,128 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:32,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,200 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:32,201 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:32,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,216 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,221 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:32,222 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:32,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,235 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,240 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:32,240 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:32,254 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:32,254 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:32,263 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:32,263 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:32,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:32,283 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:32,283 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:32,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,307 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,311 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:32,311 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:32,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:32,323 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:32,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:32,341 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:32,350 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:32,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:32,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:32,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:32,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:32,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:32,351 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:32,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2019-11-16 00:11:32,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:32,351 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:32,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:32,423 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:32,423 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:32,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:32,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,427 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:32,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:32,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:32,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:32,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,440 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,440 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:32,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:32,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:32,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:32,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:32,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:32,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:32,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:32,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:32,446 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:32,448 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:11:32,448 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:11:32,448 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:32,449 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:32,449 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:32,449 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-11-16 00:11:32,450 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:32,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:11:32,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:32,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:11:32,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:32,568 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 [2019-11-16 00:11:32,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2019-11-16 00:11:32,750 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. [2019-11-16 00:11:32,752 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 [2019-11-16 00:11:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:11:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2019-11-16 00:11:32,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-16 00:11:32,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:32,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2019-11-16 00:11:32,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:32,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-16 00:11:32,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:32,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2019-11-16 00:11:32,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:11:32,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2019-11-16 00:11:32,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-11-16 00:11:32,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-11-16 00:11:32,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2019-11-16 00:11:32,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:32,765 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2019-11-16 00:11:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2019-11-16 00:11:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2019-11-16 00:11:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-16 00:11:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2019-11-16 00:11:32,787 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2019-11-16 00:11:32,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:11:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:11:32,788 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2019-11-16 00:11:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:32,846 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2019-11-16 00:11:32,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:11:32,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2019-11-16 00:11:32,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:11:32,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2019-11-16 00:11:32,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-11-16 00:11:32,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-16 00:11:32,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2019-11-16 00:11:32,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:32,852 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-11-16 00:11:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2019-11-16 00:11:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-16 00:11:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-16 00:11:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2019-11-16 00:11:32,865 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-11-16 00:11:32,865 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-11-16 00:11:32,865 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:11:32,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2019-11-16 00:11:32,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:11:32,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:32,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:32,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:32,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:11:32,869 INFO L791 eck$LassoCheckResult]: Stem: 2269#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; 2250#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; 2229#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2239#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2241#L56 assume !(~n <= 1); 2284#L59 assume !(2 == ~n); 2285#L62 assume ~n > 2; 2246#L63 assume !(~m <= 1); 2214#L66 call #t~ret6 := multiple_of(~n, ~m);< 2276#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2273#L30 assume !(~m < 0); 2261#L33 assume ~n < 0; 2201#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2216#multiple_ofENTRY [2019-11-16 00:11:32,869 INFO L793 eck$LassoCheckResult]: Loop: 2216#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2306#L30 assume !(~m < 0); 2305#L33 assume ~n < 0; 2202#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2216#multiple_ofENTRY [2019-11-16 00:11:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2019-11-16 00:11:32,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:32,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318988490] [2019-11-16 00:11:32,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:32,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:32,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:32,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318988490] [2019-11-16 00:11:32,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:32,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:11:32,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462161973] [2019-11-16 00:11:32,939 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2019-11-16 00:11:32,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:32,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934844409] [2019-11-16 00:11:32,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:32,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:32,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:32,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:32,996 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:32,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:32,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:32,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:32,996 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:32,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:32,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:32,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:32,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2019-11-16 00:11:32,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:32,997 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:32,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,072 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:33,072 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:33,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:33,081 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:33,081 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:33,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:33,089 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:33,089 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:33,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:33,100 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:33,100 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:33,106 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:33,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:33,128 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:33,130 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:33,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:33,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:33,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:33,130 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:33,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:33,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:33,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2019-11-16 00:11:33,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:33,131 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:33,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,208 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:33,209 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:33,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:33,210 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:33,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:33,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:33,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:33,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:33,211 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:33,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:33,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:33,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:33,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:33,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:33,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:33,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:33,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:33,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:33,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:33,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:33,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:33,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:33,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:33,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:33,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:33,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:33,223 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:33,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:33,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:33,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:33,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:33,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:33,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:33,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:33,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:33,233 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:33,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:33,236 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:33,242 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:11:33,242 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:11:33,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:33,243 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:33,243 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:33,244 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2019-11-16 00:11:33,244 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:33,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:11:33,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:33,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:11:33,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:33,340 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:11:33,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2019-11-16 00:11:33,435 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. [2019-11-16 00:11:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:11:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2019-11-16 00:11:33,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2019-11-16 00:11:33,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:33,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-16 00:11:33,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:33,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-16 00:11:33,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:33,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2019-11-16 00:11:33,450 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2019-11-16 00:11:33,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2019-11-16 00:11:33,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2019-11-16 00:11:33,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2019-11-16 00:11:33,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2019-11-16 00:11:33,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:33,460 INFO L688 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2019-11-16 00:11:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2019-11-16 00:11:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2019-11-16 00:11:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-16 00:11:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2019-11-16 00:11:33,476 INFO L711 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2019-11-16 00:11:33,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:33,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:11:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:11:33,477 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2019-11-16 00:11:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:33,621 INFO L93 Difference]: Finished difference Result 220 states and 287 transitions. [2019-11-16 00:11:33,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:11:33,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 287 transitions. [2019-11-16 00:11:33,626 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:11:33,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 287 transitions. [2019-11-16 00:11:33,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-11-16 00:11:33,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-11-16 00:11:33,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 287 transitions. [2019-11-16 00:11:33,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:33,631 INFO L688 BuchiCegarLoop]: Abstraction has 220 states and 287 transitions. [2019-11-16 00:11:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 287 transitions. [2019-11-16 00:11:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2019-11-16 00:11:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-16 00:11:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 282 transitions. [2019-11-16 00:11:33,641 INFO L711 BuchiCegarLoop]: Abstraction has 216 states and 282 transitions. [2019-11-16 00:11:33,641 INFO L591 BuchiCegarLoop]: Abstraction has 216 states and 282 transitions. [2019-11-16 00:11:33,641 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:11:33,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 282 transitions. [2019-11-16 00:11:33,643 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:11:33,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:33,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:33,644 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:33,644 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:11:33,645 INFO L791 eck$LassoCheckResult]: Stem: 3207#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; 3176#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; 3163#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3164#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3166#L56 assume !(~n <= 1); 3270#L59 assume !(2 == ~n); 3269#L62 assume ~n > 2; 3266#L63 assume !(~m <= 1); 3239#L66 call #t~ret6 := multiple_of(~n, ~m);< 3261#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3260#L30 assume !(~m < 0); 3259#L33 assume !(~n < 0); 3258#L36 assume !(0 == ~m); 3257#L39 assume !(0 == ~n); 3122#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3237#multiple_ofENTRY [2019-11-16 00:11:33,645 INFO L793 eck$LassoCheckResult]: Loop: 3237#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3235#L30 assume !(~m < 0); 3229#L33 assume !(~n < 0); 3230#L36 assume !(0 == ~m); 3255#L39 assume !(0 == ~n); 3121#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3237#multiple_ofENTRY [2019-11-16 00:11:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2019-11-16 00:11:33,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:33,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225084165] [2019-11-16 00:11:33,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:33,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:33,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:33,681 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2019-11-16 00:11:33,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:33,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876239297] [2019-11-16 00:11:33,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:33,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:33,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:33,696 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2019-11-16 00:11:33,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:33,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543174090] [2019-11-16 00:11:33,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:33,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:33,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:33,742 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:33,845 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:33,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:33,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:33,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:33,846 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:33,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:33,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:33,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2019-11-16 00:11:33,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:33,847 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:33,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:33,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:33,976 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:33,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:33,983 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:33,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:33,988 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:33,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:33,995 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:34,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:34,015 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:34,164 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:34,166 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:34,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:34,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:34,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:34,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:34,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:34,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:34,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:34,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2019-11-16 00:11:34,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:34,167 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:34,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,284 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:34,284 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:34,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:34,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:34,286 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:34,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:34,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:34,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:34,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:34,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:34,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:34,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:34,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:34,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:34,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:34,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:34,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:34,288 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:34,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:34,291 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:34,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:11:34,293 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:11:34,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:34,294 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:34,294 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:34,294 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2019-11-16 00:11:34,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:34,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:11:34,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:34,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:11:34,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:34,476 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:11:34,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 216 states and 282 transitions. cyclomatic complexity: 76 Second operand 6 states. [2019-11-16 00:11:34,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 216 states and 282 transitions. cyclomatic complexity: 76. Second operand 6 states. Result 315 states and 416 transitions. Complement of second has 21 states. [2019-11-16 00:11:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:11:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2019-11-16 00:11:34,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-16 00:11:34,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:34,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2019-11-16 00:11:34,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:34,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2019-11-16 00:11:34,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:34,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 416 transitions. [2019-11-16 00:11:34,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2019-11-16 00:11:34,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 284 states and 368 transitions. [2019-11-16 00:11:34,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-11-16 00:11:34,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2019-11-16 00:11:34,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 368 transitions. [2019-11-16 00:11:34,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:34,644 INFO L688 BuchiCegarLoop]: Abstraction has 284 states and 368 transitions. [2019-11-16 00:11:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 368 transitions. [2019-11-16 00:11:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 251. [2019-11-16 00:11:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:11:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2019-11-16 00:11:34,655 INFO L711 BuchiCegarLoop]: Abstraction has 251 states and 326 transitions. [2019-11-16 00:11:34,656 INFO L591 BuchiCegarLoop]: Abstraction has 251 states and 326 transitions. [2019-11-16 00:11:34,656 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:11:34,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 326 transitions. [2019-11-16 00:11:34,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:11:34,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:34,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:34,659 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:34,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:11:34,660 INFO L791 eck$LassoCheckResult]: Stem: 3849#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; 3814#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; 3788#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3803#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3805#L56 assume !(~n <= 1); 3787#L59 assume 2 == ~n;#res := 1; 3789#is_prime_FINAL assume true; 3863#is_prime_EXIT >#117#return; 3798#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3785#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; 3786#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3827#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 3828#L95 assume main_#t~short13; 3774#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3804#multENTRY ~n := #in~n;~m := #in~m; 3773#L16 assume !(~m < 0); 3776#L19 [2019-11-16 00:11:34,660 INFO L793 eck$LassoCheckResult]: Loop: 3776#L19 assume !(0 == ~m); 3820#L22 assume !(1 == ~m); 3795#L25 call #t~ret1 := mult(~n, ~m - 1);< 3797#multENTRY ~n := #in~n;~m := #in~m; 3833#L16 assume !(~m < 0); 3776#L19 [2019-11-16 00:11:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2019-11-16 00:11:34,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:34,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861694008] [2019-11-16 00:11:34,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:34,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:34,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:34,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2019-11-16 00:11:34,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:34,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808880752] [2019-11-16 00:11:34,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:34,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:34,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:34,684 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2019-11-16 00:11:34,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:34,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740692916] [2019-11-16 00:11:34,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:34,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:34,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:34,700 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:34,803 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:34,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:34,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:34,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:34,804 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:34,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:34,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:34,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:34,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2019-11-16 00:11:34,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:34,805 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:34,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:34,897 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:34,897 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:34,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:34,902 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:34,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:34,906 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:34,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:34,917 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:34,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:34,928 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:34,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:34,938 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:34,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:34,960 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:36,088 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:36,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:36,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:36,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:36,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:36,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:36,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:36,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2019-11-16 00:11:36,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:36,089 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:36,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,203 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:36,204 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:36,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:36,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:36,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:36,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:36,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:36,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:36,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:36,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:36,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:36,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:36,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:36,207 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:36,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:36,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:36,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:36,208 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:36,208 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:36,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:36,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:36,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:36,209 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:36,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:36,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:36,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:36,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:36,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:36,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:36,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:36,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:36,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:36,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:36,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:36,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:36,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:36,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:36,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:36,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:36,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:36,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:36,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:36,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:36,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:36,221 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:36,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:36,224 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:36,226 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:11:36,226 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:11:36,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:36,227 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:36,227 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:36,228 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2019-11-16 00:11:36,228 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:36,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:11:36,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:36,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:11:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:36,332 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 [2019-11-16 00:11:36,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 251 states and 326 transitions. cyclomatic complexity: 87 Second operand 6 states. [2019-11-16 00:11:36,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 251 states and 326 transitions. cyclomatic complexity: 87. Second operand 6 states. Result 275 states and 353 transitions. Complement of second has 17 states. [2019-11-16 00:11:36,463 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 [2019-11-16 00:11:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:11:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2019-11-16 00:11:36,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2019-11-16 00:11:36,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:36,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-16 00:11:36,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:36,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2019-11-16 00:11:36,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:36,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 353 transitions. [2019-11-16 00:11:36,469 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:11:36,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 274 states and 352 transitions. [2019-11-16 00:11:36,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2019-11-16 00:11:36,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-11-16 00:11:36,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 352 transitions. [2019-11-16 00:11:36,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:36,474 INFO L688 BuchiCegarLoop]: Abstraction has 274 states and 352 transitions. [2019-11-16 00:11:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 352 transitions. [2019-11-16 00:11:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2019-11-16 00:11:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-16 00:11:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 338 transitions. [2019-11-16 00:11:36,484 INFO L711 BuchiCegarLoop]: Abstraction has 261 states and 338 transitions. [2019-11-16 00:11:36,484 INFO L591 BuchiCegarLoop]: Abstraction has 261 states and 338 transitions. [2019-11-16 00:11:36,485 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:11:36,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 338 transitions. [2019-11-16 00:11:36,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:11:36,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:36,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:36,488 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:36,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:11:36,489 INFO L791 eck$LassoCheckResult]: Stem: 4481#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; 4451#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; 4438#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4439#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4441#L56 assume !(~n <= 1); 4495#L59 assume 2 == ~n;#res := 1; 4494#is_prime_FINAL assume true; 4492#is_prime_EXIT >#117#return; 4430#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4414#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; 4415#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4470#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4471#L95 assume main_#t~short13; 4403#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4440#multENTRY ~n := #in~n;~m := #in~m; 4402#L16 assume !(~m < 0); 4404#L19 assume !(0 == ~m); 4466#L22 assume !(1 == ~m); 4472#L25 call #t~ret1 := mult(~n, ~m - 1);< 4649#multENTRY ~n := #in~n;~m := #in~m; 4500#L16 assume ~m < 0; 4426#L17 [2019-11-16 00:11:36,489 INFO L793 eck$LassoCheckResult]: Loop: 4426#L17 call #t~ret0 := mult(~n, -~m);< 4427#multENTRY ~n := #in~n;~m := #in~m; 4501#L16 assume ~m < 0; 4426#L17 [2019-11-16 00:11:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2019-11-16 00:11:36,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:36,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198741826] [2019-11-16 00:11:36,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:36,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:36,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:36,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198741826] [2019-11-16 00:11:36,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:36,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:11:36,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960502834] [2019-11-16 00:11:36,544 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2019-11-16 00:11:36,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:36,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019940611] [2019-11-16 00:11:36,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:36,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:36,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:36,549 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:36,602 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:36,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:36,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:36,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:36,602 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:36,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:36,602 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:36,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2019-11-16 00:11:36,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:36,603 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:36,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:36,659 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:36,659 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:36,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:36,667 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:36,667 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:36,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:36,675 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:36,675 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:36,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:36,691 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:36,698 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=4, mult_#in~n=4} Honda state: {mult_~n=4, mult_#in~n=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:11:36,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:36,704 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:36,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:36,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:37,515 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:37,517 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:37,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:37,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:37,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:37,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:37,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:37,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:37,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:37,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2019-11-16 00:11:37,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:37,518 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:37,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:37,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:37,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:37,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:37,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:37,600 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:37,600 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:37,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:37,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:37,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:37,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:37,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:37,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:37,602 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:37,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:37,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:37,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:37,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:37,604 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:37,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:37,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:37,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:37,605 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:37,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:37,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:37,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:37,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:37,606 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:37,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:37,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:37,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:37,607 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:37,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:37,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:37,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:37,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:37,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:37,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:37,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:37,609 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:37,609 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:37,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:37,620 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:37,622 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:11:37,623 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:11:37,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:37,625 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:37,625 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:37,625 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2019-11-16 00:11:37,626 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:37,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:11:37,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:37,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:11:37,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:37,709 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 [2019-11-16 00:11:37,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 338 transitions. cyclomatic complexity: 90 Second operand 5 states. [2019-11-16 00:11:37,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 338 transitions. cyclomatic complexity: 90. Second operand 5 states. Result 302 states and 384 transitions. Complement of second has 11 states. [2019-11-16 00:11:37,822 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 [2019-11-16 00:11:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:11:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-11-16 00:11:37,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-16 00:11:37,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:37,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-16 00:11:37,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:37,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2019-11-16 00:11:37,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:37,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 384 transitions. [2019-11-16 00:11:37,829 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:11:37,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 292 states and 374 transitions. [2019-11-16 00:11:37,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2019-11-16 00:11:37,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-11-16 00:11:37,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2019-11-16 00:11:37,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:37,837 INFO L688 BuchiCegarLoop]: Abstraction has 292 states and 374 transitions. [2019-11-16 00:11:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2019-11-16 00:11:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 279. [2019-11-16 00:11:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-16 00:11:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 360 transitions. [2019-11-16 00:11:37,849 INFO L711 BuchiCegarLoop]: Abstraction has 279 states and 360 transitions. [2019-11-16 00:11:37,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:11:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:11:37,851 INFO L87 Difference]: Start difference. First operand 279 states and 360 transitions. Second operand 6 states. [2019-11-16 00:11:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:37,906 INFO L93 Difference]: Finished difference Result 275 states and 351 transitions. [2019-11-16 00:11:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:11:37,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 351 transitions. [2019-11-16 00:11:37,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-16 00:11:37,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 196 states and 236 transitions. [2019-11-16 00:11:37,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-11-16 00:11:37,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-16 00:11:37,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2019-11-16 00:11:37,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:37,914 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2019-11-16 00:11:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2019-11-16 00:11:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2019-11-16 00:11:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-16 00:11:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2019-11-16 00:11:37,920 INFO L711 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-11-16 00:11:37,921 INFO L591 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-11-16 00:11:37,921 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:11:37,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2019-11-16 00:11:37,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-16 00:11:37,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:37,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:37,923 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:37,923 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:11:37,924 INFO L791 eck$LassoCheckResult]: Stem: 5667#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; 5668#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; 5642#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5655#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5656#L56 assume !(~n <= 1); 5649#L59 assume !(2 == ~n); 5650#L62 assume ~n > 2; 5661#L63 assume !(~m <= 1); 5742#L66 call #t~ret6 := multiple_of(~n, ~m);< 5761#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5758#L30 assume !(~m < 0); 5747#L33 assume !(~n < 0); 5745#L36 assume !(0 == ~m); 5744#L39 assume !(0 == ~n); 5687#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5738#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5739#L30 assume !(~m < 0); 5764#L33 assume ~n < 0; 5626#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5763#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5679#L30 assume !(~m < 0); 5623#L33 assume !(~n < 0); 5625#L36 [2019-11-16 00:11:37,924 INFO L793 eck$LassoCheckResult]: Loop: 5625#L36 assume !(0 == ~m); 5653#L39 assume !(0 == ~n); 5645#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5644#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5789#L30 assume !(~m < 0); 5782#L33 assume !(~n < 0); 5625#L36 [2019-11-16 00:11:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2019-11-16 00:11:37,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:37,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351661385] [2019-11-16 00:11:37,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:37,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:37,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:38,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351661385] [2019-11-16 00:11:38,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219198095] [2019-11-16 00:11:38,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:11:38,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:38,142 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:38,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-16 00:11:38,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354748336] [2019-11-16 00:11:38,143 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2019-11-16 00:11:38,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:38,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415253440] [2019-11-16 00:11:38,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:38,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:38,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:38,149 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:38,265 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:38,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:38,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:38,265 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:38,265 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:11:38,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:38,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:38,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:38,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration10_Loop [2019-11-16 00:11:38,266 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:38,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:38,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:38,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:38,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:38,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:38,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:38,365 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:38,366 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:38,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:38,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:38,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:11:38,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:38,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:11:38,385 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:38,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:11:38,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:11:41,321 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:11:41,323 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:41,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:41,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:41,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:41,324 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:41,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:41,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:41,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:41,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration10_Loop [2019-11-16 00:11:41,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:41,324 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:41,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:41,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:41,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:41,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:41,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:41,432 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:41,432 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:41,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:41,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:41,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:41,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:41,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:41,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:41,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:41,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:41,437 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:41,441 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:11:41,441 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:11:41,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:41,442 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:11:41,442 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:41,442 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2019-11-16 00:11:41,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:11:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:41,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:11:41,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:41,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:11:41,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:41,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:41,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:41,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:11:41,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-11-16 00:11:41,752 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. [2019-11-16 00:11:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:11:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-16 00:11:41,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-16 00:11:41,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:41,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:11:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:41,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:11:41,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:41,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:11:41,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:41,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:41,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:41,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:11:41,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-11-16 00:11:42,008 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. [2019-11-16 00:11:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:11:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-16 00:11:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-16 00:11:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:42,009 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:11:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:42,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:11:42,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:42,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:11:42,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:42,158 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:11:42,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-11-16 00:11:42,301 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. [2019-11-16 00:11:42,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:11:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2019-11-16 00:11:42,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-16 00:11:42,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:42,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2019-11-16 00:11:42,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:42,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2019-11-16 00:11:42,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:42,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2019-11-16 00:11:42,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-16 00:11:42,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2019-11-16 00:11:42,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-16 00:11:42,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-11-16 00:11:42,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2019-11-16 00:11:42,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:42,340 INFO L688 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-11-16 00:11:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2019-11-16 00:11:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2019-11-16 00:11:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-16 00:11:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2019-11-16 00:11:42,350 INFO L711 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2019-11-16 00:11:42,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:42,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:11:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:11:42,355 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2019-11-16 00:11:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:42,479 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2019-11-16 00:11:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:11:42,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2019-11-16 00:11:42,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-16 00:11:42,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2019-11-16 00:11:42,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-16 00:11:42,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-16 00:11:42,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2019-11-16 00:11:42,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:42,487 INFO L688 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2019-11-16 00:11:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2019-11-16 00:11:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2019-11-16 00:11:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-16 00:11:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2019-11-16 00:11:42,495 INFO L711 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2019-11-16 00:11:42,495 INFO L591 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2019-11-16 00:11:42,495 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:11:42,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2019-11-16 00:11:42,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-16 00:11:42,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:42,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:42,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:42,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:42,499 INFO L791 eck$LassoCheckResult]: Stem: 7339#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; 7340#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; 7301#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7325#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7326#L56 assume !(~n <= 1); 7346#L59 assume !(2 == ~n); 7331#L62 assume ~n > 2; 7332#L63 assume !(~m <= 1); 7351#L66 call #t~ret6 := multiple_of(~n, ~m);< 7352#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7402#L30 assume !(~m < 0); 7401#L33 assume !(~n < 0); 7400#L36 assume !(0 == ~m); 7385#L39 assume !(0 == ~n); 7378#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7394#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7393#L30 assume !(~m < 0); 7392#L33 assume !(~n < 0); 7384#L36 assume !(0 == ~m); 7381#L39 assume !(0 == ~n); 7368#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7377#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7376#L30 assume !(~m < 0); 7367#L33 assume ~n < 0; 7294#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7372#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7371#L30 assume !(~m < 0); 7292#L33 assume !(~n < 0); 7295#L36 [2019-11-16 00:11:42,499 INFO L793 eck$LassoCheckResult]: Loop: 7295#L36 assume !(0 == ~m); 7335#L39 assume !(0 == ~n); 7313#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7357#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7395#L30 assume !(~m < 0); 7373#L33 assume ~n < 0; 7312#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7314#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7374#L30 assume !(~m < 0); 7375#L33 assume !(~n < 0); 7295#L36 [2019-11-16 00:11:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2019-11-16 00:11:42,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:42,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125015491] [2019-11-16 00:11:42,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:42,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:42,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:42,515 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2019-11-16 00:11:42,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:42,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092774934] [2019-11-16 00:11:42,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:42,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:42,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:42,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2019-11-16 00:11:42,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:42,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41431627] [2019-11-16 00:11:42,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:42,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:42,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:42,543 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:43,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:11:43 BoogieIcfgContainer [2019-11-16 00:11:43,217 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:11:43,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:11:43,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:11:43,218 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:11:43,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:26" (3/4) ... [2019-11-16 00:11:43,221 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:11:43,265 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b345cceb-ff69-43b1-9c0f-ab57c73646ca/bin/uautomizer/witness.graphml [2019-11-16 00:11:43,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:11:43,267 INFO L168 Benchmark]: Toolchain (without parser) took 18047.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 121.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:43,268 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:43,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:43,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:43,269 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:43,270 INFO L168 Benchmark]: RCFGBuilder took 435.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:43,270 INFO L168 Benchmark]: BuchiAutomizer took 17092.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.3 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:43,270 INFO L168 Benchmark]: Witness Printer took 48.14 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:43,272 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17092.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.3 MB). Peak memory consumption was 128.6 MB. Max. memory is 11.5 GB. * Witness Printer took 48.14 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 7 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 9 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(n) and consists of 4 locations. One deterministic module has affine ranking function \old(n) and consists of 6 locations. One deterministic module has affine ranking function m and consists of 6 locations. One deterministic module has affine ranking function m and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 12.2s. Construction of modules took 1.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 304 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 261 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 693 SDtfs, 703 SDslu, 1178 SDs, 0 SdLazy, 968 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 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: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.3s - 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@5d366df4=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@668d5bac=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c838bde=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e40bba4=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cf09f68=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7755d52c=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5efae0ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5eb6072c=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41d084b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@613ababb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78104da3=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5dbb9763=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...