./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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:30,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:30,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:30,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:30,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:30,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:30,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:30,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:30,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:31,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:31,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:31,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:31,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:31,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:31,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:31,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:31,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:31,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:31,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:31,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:31,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:31,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:31,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:31,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:31,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:31,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:31,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:31,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:31,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:31,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:31,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:31,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:31,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:31,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:31,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:31,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:31,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:31,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:31,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:31,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:31,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:31,023 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:31,035 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:31,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:31,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:31,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:31,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:31,037 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:31,037 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:31,037 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:31,037 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:31,037 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:31,038 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:31,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:31,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:31,038 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:31,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:31,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:31,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:31,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:31,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:31,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:31,039 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:31,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:31,040 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:31,040 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:31,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:31,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:31,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:31,041 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:31,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:31,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:31,041 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:31,042 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:31,043 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:31,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:31,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:31,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:31,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:31,081 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:31,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/../../sv-benchmarks/c/recursive/Primes.c [2019-10-22 09:00:31,128 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/data/c45dee49d/024fe9ad2be04798847e83475046f1f8/FLAG63f16c7da [2019-10-22 09:00:31,478 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:31,479 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/sv-benchmarks/c/recursive/Primes.c [2019-10-22 09:00:31,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/data/c45dee49d/024fe9ad2be04798847e83475046f1f8/FLAG63f16c7da [2019-10-22 09:00:31,497 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/data/c45dee49d/024fe9ad2be04798847e83475046f1f8 [2019-10-22 09:00:31,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:31,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:31,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:31,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:31,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:31,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182b198d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31, skipping insertion in model container [2019-10-22 09:00:31,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:31,533 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:31,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:31,684 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:31,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:31,774 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:31,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31 WrapperNode [2019-10-22 09:00:31,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:31,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:31,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:31,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:31,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:31,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:31,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:31,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:31,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:31,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:31,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:31,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:31,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-10-22 09:00:31,882 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-10-22 09:00:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-10-22 09:00:31,882 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-10-22 09:00:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:31,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-10-22 09:00:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-10-22 09:00:32,226 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:32,228 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 09:00:32,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:32 BoogieIcfgContainer [2019-10-22 09:00:32,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:32,231 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:32,231 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:32,235 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:32,236 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:32,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:31" (1/3) ... [2019-10-22 09:00:32,237 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a0a082a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:32, skipping insertion in model container [2019-10-22 09:00:32,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:32,237 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (2/3) ... [2019-10-22 09:00:32,238 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a0a082a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:32, skipping insertion in model container [2019-10-22 09:00:32,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:32,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:32" (3/3) ... [2019-10-22 09:00:32,240 INFO L371 chiAutomizerObserver]: Analyzing ICFG Primes.c [2019-10-22 09:00:32,285 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:32,286 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:32,286 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:32,286 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:32,286 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:32,286 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:32,286 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:32,286 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:32,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2019-10-22 09:00:32,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 09:00:32,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:32,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:32,344 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:32,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2019-10-22 09:00:32,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 09:00:32,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:32,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:32,357 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-10-22 09:00:32,357 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-10-22 09:00:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2019-10-22 09:00:32,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360706935] [2019-10-22 09:00:32,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,466 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2019-10-22 09:00:32,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676865871] [2019-10-22 09:00:32,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:32,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676865871] [2019-10-22 09:00:32,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:32,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:32,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824518706] [2019-10-22 09:00:32,555 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:32,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:32,571 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2019-10-22 09:00:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:32,674 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2019-10-22 09:00:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:32,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2019-10-22 09:00:32,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 09:00:32,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2019-10-22 09:00:32,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-10-22 09:00:32,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 09:00:32,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2019-10-22 09:00:32,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:32,693 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-22 09:00:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2019-10-22 09:00:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-10-22 09:00:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 09:00:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-10-22 09:00:32,741 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-10-22 09:00:32,741 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-10-22 09:00:32,741 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:32,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-10-22 09:00:32,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 09:00:32,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,744 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:32,744 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:32,744 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-10-22 09:00:32,744 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-10-22 09:00:32,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,744 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2019-10-22 09:00:32,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528960919] [2019-10-22 09:00:32,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,757 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2019-10-22 09:00:32,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29005625] [2019-10-22 09:00:32,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:32,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29005625] [2019-10-22 09:00:32,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:32,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:32,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730602652] [2019-10-22 09:00:32,822 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:32,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:32,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:32,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:32,822 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-10-22 09:00:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:32,949 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-10-22 09:00:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:32,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-10-22 09:00:32,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 09:00:32,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2019-10-22 09:00:32,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-10-22 09:00:32,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-10-22 09:00:32,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2019-10-22 09:00:32,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:32,965 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-10-22 09:00:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2019-10-22 09:00:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-22 09:00:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 09:00:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-10-22 09:00:32,975 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-22 09:00:32,975 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-22 09:00:32,976 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:32,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2019-10-22 09:00:32,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 09:00:32,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:32,978 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-10-22 09:00:32,978 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-10-22 09:00:32,978 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-10-22 09:00:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2019-10-22 09:00:32,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682893453] [2019-10-22 09:00:32,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,000 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:33,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2019-10-22 09:00:33,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973363294] [2019-10-22 09:00:33,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:33,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2019-10-22 09:00:33,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:33,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647366770] [2019-10-22 09:00:33,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:33,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:33,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647366770] [2019-10-22 09:00:33,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085168383] [2019-10-22 09:00:33,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:33,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:33,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:33,292 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:33,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-10-22 09:00:33,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441541406] [2019-10-22 09:00:33,564 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:33,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:33,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:33,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:33,565 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:33,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:33,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:33,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:33,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2019-10-22 09:00:33,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:33,566 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:33,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,650 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:33,651 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:33,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:33,675 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:33,676 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:33,685 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-10-22 09:00:33,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:33,689 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:33,698 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-10-22 09:00:33,702 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:33,702 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:33,710 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-10-22 09:00:33,714 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:33,714 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:33,726 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:33,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:33,737 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-10-22 09:00:33,833 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:33,836 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:33,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:33,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:33,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:33,837 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:33,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:33,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:33,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:33,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2019-10-22 09:00:33,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:33,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:33,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,920 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:33,925 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:33,927 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-10-22 09:00:33,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,940 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-10-22 09:00:33,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,941 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,942 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,943 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-10-22 09:00:33,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,947 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-10-22 09:00:33,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,955 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:33,963 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:33,963 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:33,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:33,965 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:33,965 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:33,966 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2019-10-22 09:00:33,973 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:34,157 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-10-22 09:00:34,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-10-22 09:00:34,537 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-10-22 09:00:34,537 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-10-22 09:00:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2019-10-22 09:00:34,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2019-10-22 09:00:34,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2019-10-22 09:00:34,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2019-10-22 09:00:34,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2019-10-22 09:00:34,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2019-10-22 09:00:34,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2019-10-22 09:00:34,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-10-22 09:00:34,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-10-22 09:00:34,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2019-10-22 09:00:34,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:34,559 INFO L688 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2019-10-22 09:00:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2019-10-22 09:00:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2019-10-22 09:00:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 09:00:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2019-10-22 09:00:34,573 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2019-10-22 09:00:34,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:34,574 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 10 states. [2019-10-22 09:00:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:34,761 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2019-10-22 09:00:34,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:34,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2019-10-22 09:00:34,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-10-22 09:00:34,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2019-10-22 09:00:34,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-10-22 09:00:34,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-10-22 09:00:34,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2019-10-22 09:00:34,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:34,767 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2019-10-22 09:00:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2019-10-22 09:00:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2019-10-22 09:00:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 09:00:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2019-10-22 09:00:34,776 INFO L711 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-10-22 09:00:34,776 INFO L591 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-10-22 09:00:34,776 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:34,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2019-10-22 09:00:34,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-10-22 09:00:34,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:34,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:34,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:34,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:34,779 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-10-22 09:00:34,779 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-10-22 09:00:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2019-10-22 09:00:34,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710024044] [2019-10-22 09:00:34,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:34,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710024044] [2019-10-22 09:00:34,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:34,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:34,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830521602] [2019-10-22 09:00:34,808 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2019-10-22 09:00:34,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581378431] [2019-10-22 09:00:34,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,815 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,873 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:34,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:34,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:34,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:34,873 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:34,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:34,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:34,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:34,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2019-10-22 09:00:34,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:34,873 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:34,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,930 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:34,930 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:34,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:34,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:34,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:34,937 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:34,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:34,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:34,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:34,947 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:34,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:34,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:34,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:34,970 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:34,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:34,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:34,983 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:34,983 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:34,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:34,995 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:35,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:35,009 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-10-22 09:00:36,221 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:36,223 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:36,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:36,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:36,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:36,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:36,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:36,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:36,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2019-10-22 09:00:36,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:36,224 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:36,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,275 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:36,275 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:36,275 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-10-22 09:00:36,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,277 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,278 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-10-22 09:00:36,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,281 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-10-22 09:00:36,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,283 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,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-10-22 09:00:36,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,288 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-10-22 09:00:36,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,289 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,293 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:36,295 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 09:00:36,295 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:36,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:36,296 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:36,296 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:36,296 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2019-10-22 09:00:36,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:36,375 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-10-22 09:00:36,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2019-10-22 09:00:36,428 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-10-22 09:00:36,429 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-10-22 09:00:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2019-10-22 09:00:36,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 09:00:36,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 09:00:36,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 09:00:36,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2019-10-22 09:00:36,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2019-10-22 09:00:36,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2019-10-22 09:00:36,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-10-22 09:00:36,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-10-22 09:00:36,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2019-10-22 09:00:36,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:36,439 INFO L688 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2019-10-22 09:00:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2019-10-22 09:00:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2019-10-22 09:00:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 09:00:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2019-10-22 09:00:36,446 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2019-10-22 09:00:36,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:36,446 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2019-10-22 09:00:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:36,478 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2019-10-22 09:00:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:36,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2019-10-22 09:00:36,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:36,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2019-10-22 09:00:36,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2019-10-22 09:00:36,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2019-10-22 09:00:36,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2019-10-22 09:00:36,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:36,483 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-10-22 09:00:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2019-10-22 09:00:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-10-22 09:00:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 09:00:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2019-10-22 09:00:36,489 INFO L711 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-10-22 09:00:36,489 INFO L591 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-10-22 09:00:36,489 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:36,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2019-10-22 09:00:36,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:36,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:36,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:36,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:36,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:36,491 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-10-22 09:00:36,491 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-10-22 09:00:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2019-10-22 09:00:36,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667292041] [2019-10-22 09:00:36,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:36,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667292041] [2019-10-22 09:00:36,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:36,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:36,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334621672] [2019-10-22 09:00:36,528 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2019-10-22 09:00:36,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096196885] [2019-10-22 09:00:36,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,533 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,564 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:36,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:36,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:36,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:36,564 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:36,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:36,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:36,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2019-10-22 09:00:36,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:36,565 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:36,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,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-10-22 09:00:36,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,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-10-22 09:00:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,606 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:36,606 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:36,615 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:36,615 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:36,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,621 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-10-22 09:00:36,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:36,624 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:36,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,632 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,635 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:36,635 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:36,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,642 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:36,645 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:36,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,657 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,662 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:36,663 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:36,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,669 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-10-22 09:00:36,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:36,672 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:36,681 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:36,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:36,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:36,704 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:36,705 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:36,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:36,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:36,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:36,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:36,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:36,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:36,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2019-10-22 09:00:36,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:36,706 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:36,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,755 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:36,755 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:36,755 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-10-22 09:00:36,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,757 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,757 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,758 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-10-22 09:00:36,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,764 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-10-22 09:00:36,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,765 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,772 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-10-22 09:00:36,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,775 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-10-22 09:00:36,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,777 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-10-22 09:00:36,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,781 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,786 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,787 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-10-22 09:00:36,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,793 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:36,794 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 09:00:36,794 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:36,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:36,794 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:36,795 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:36,795 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-10-22 09:00:36,795 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:36,876 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-10-22 09:00:36,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2019-10-22 09:00:36,991 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-10-22 09:00:36,992 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-10-22 09:00:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2019-10-22 09:00:36,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 09:00:36,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2019-10-22 09:00:36,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2019-10-22 09:00:36,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2019-10-22 09:00:36,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:36,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2019-10-22 09:00:36,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-10-22 09:00:36,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-10-22 09:00:37,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2019-10-22 09:00:37,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:37,005 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2019-10-22 09:00:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2019-10-22 09:00:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2019-10-22 09:00:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-22 09:00:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2019-10-22 09:00:37,020 INFO L711 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2019-10-22 09:00:37,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:37,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:37,020 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2019-10-22 09:00:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:37,071 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2019-10-22 09:00:37,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:37,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2019-10-22 09:00:37,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:37,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2019-10-22 09:00:37,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-10-22 09:00:37,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-10-22 09:00:37,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2019-10-22 09:00:37,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:37,076 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-10-22 09:00:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2019-10-22 09:00:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-10-22 09:00:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 09:00:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2019-10-22 09:00:37,088 INFO L711 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-10-22 09:00:37,088 INFO L591 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-10-22 09:00:37,089 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:37,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2019-10-22 09:00:37,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:37,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:37,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:37,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:37,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:37,092 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-10-22 09:00:37,092 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-10-22 09:00:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2019-10-22 09:00:37,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736371103] [2019-10-22 09:00:37,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:37,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736371103] [2019-10-22 09:00:37,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:37,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:37,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865224778] [2019-10-22 09:00:37,136 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2019-10-22 09:00:37,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209113396] [2019-10-22 09:00:37,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,145 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,184 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,184 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:37,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2019-10-22 09:00:37,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,184 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,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-10-22 09:00:37,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:37,237 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:37,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:37,243 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:37,247 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:37,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:37,255 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:37,258 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:37,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:37,264 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:37,267 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:37,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:37,273 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:37,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:37,280 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,292 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:37,294 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:37,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,295 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2019-10-22 09:00:37,295 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,295 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,345 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:37,345 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:37,345 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-10-22 09:00:37,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,347 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-10-22 09:00:37,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,349 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-10-22 09:00:37,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,351 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-10-22 09:00:37,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,354 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:37,355 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 09:00:37,356 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:37,356 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:37,356 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:37,356 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:37,356 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2019-10-22 09:00:37,357 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:37,411 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-10-22 09:00:37,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2019-10-22 09:00:37,465 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-10-22 09:00:37,466 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-10-22 09:00:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2019-10-22 09:00:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2019-10-22 09:00:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2019-10-22 09:00:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 09:00:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2019-10-22 09:00:37,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2019-10-22 09:00:37,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2019-10-22 09:00:37,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2019-10-22 09:00:37,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2019-10-22 09:00:37,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2019-10-22 09:00:37,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:37,475 INFO L688 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2019-10-22 09:00:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2019-10-22 09:00:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2019-10-22 09:00:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-22 09:00:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2019-10-22 09:00:37,483 INFO L711 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2019-10-22 09:00:37,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:37,483 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2019-10-22 09:00:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:37,579 INFO L93 Difference]: Finished difference Result 220 states and 287 transitions. [2019-10-22 09:00:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:37,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 287 transitions. [2019-10-22 09:00:37,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 09:00:37,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 287 transitions. [2019-10-22 09:00:37,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-10-22 09:00:37,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-10-22 09:00:37,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 287 transitions. [2019-10-22 09:00:37,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:37,590 INFO L688 BuchiCegarLoop]: Abstraction has 220 states and 287 transitions. [2019-10-22 09:00:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 287 transitions. [2019-10-22 09:00:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2019-10-22 09:00:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-22 09:00:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 282 transitions. [2019-10-22 09:00:37,601 INFO L711 BuchiCegarLoop]: Abstraction has 216 states and 282 transitions. [2019-10-22 09:00:37,601 INFO L591 BuchiCegarLoop]: Abstraction has 216 states and 282 transitions. [2019-10-22 09:00:37,601 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:37,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 282 transitions. [2019-10-22 09:00:37,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 09:00:37,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:37,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:37,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:37,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:37,604 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-10-22 09:00:37,604 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-10-22 09:00:37,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2019-10-22 09:00:37,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197680347] [2019-10-22 09:00:37,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,619 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2019-10-22 09:00:37,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246115135] [2019-10-22 09:00:37,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,629 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2019-10-22 09:00:37,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272502800] [2019-10-22 09:00:37,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,719 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,719 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:37,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2019-10-22 09:00:37,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,720 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,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-10-22 09:00:37,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:37,798 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:37,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:37,804 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-10-22 09:00:37,807 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:37,808 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:37,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:37,813 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:37,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:37,917 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:37,919 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:37,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2019-10-22 09:00:37,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,001 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:38,001 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:38,001 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-10-22 09:00:38,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,002 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,004 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-10-22 09:00:38,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:38,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:38,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:38,008 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:38,010 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:38,011 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:38,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:38,011 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:38,011 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:38,011 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2019-10-22 09:00:38,012 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:38,107 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-10-22 09:00:38,108 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 216 states and 282 transitions. cyclomatic complexity: 76 Second operand 6 states. [2019-10-22 09:00:38,216 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-10-22 09:00:38,217 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-10-22 09:00:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2019-10-22 09:00:38,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 09:00:38,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2019-10-22 09:00:38,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2019-10-22 09:00:38,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 416 transitions. [2019-10-22 09:00:38,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2019-10-22 09:00:38,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 284 states and 368 transitions. [2019-10-22 09:00:38,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-10-22 09:00:38,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2019-10-22 09:00:38,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 368 transitions. [2019-10-22 09:00:38,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:38,225 INFO L688 BuchiCegarLoop]: Abstraction has 284 states and 368 transitions. [2019-10-22 09:00:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 368 transitions. [2019-10-22 09:00:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 251. [2019-10-22 09:00:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-22 09:00:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2019-10-22 09:00:38,233 INFO L711 BuchiCegarLoop]: Abstraction has 251 states and 326 transitions. [2019-10-22 09:00:38,233 INFO L591 BuchiCegarLoop]: Abstraction has 251 states and 326 transitions. [2019-10-22 09:00:38,233 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:38,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 326 transitions. [2019-10-22 09:00:38,234 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 09:00:38,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:38,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:38,235 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:38,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:38,235 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; 3862#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-10-22 09:00:38,235 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-10-22 09:00:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2019-10-22 09:00:38,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:38,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625972153] [2019-10-22 09:00:38,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2019-10-22 09:00:38,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:38,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644755577] [2019-10-22 09:00:38,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2019-10-22 09:00:38,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:38,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136810184] [2019-10-22 09:00:38,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:38,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:38,262 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:38,327 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:38,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:38,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:38,328 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:38,328 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:38,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:38,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:38,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:38,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2019-10-22 09:00:38,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:38,328 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:38,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,385 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:38,385 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:38,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:38,388 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-10-22 09:00:38,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:38,395 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:38,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:38,403 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-10-22 09:00:38,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:38,409 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:38,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:38,415 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:38,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:38,426 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-10-22 09:00:39,278 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:39,279 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:39,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:39,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:39,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:39,279 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:39,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:39,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:39,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2019-10-22 09:00:39,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:39,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:39,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,345 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:39,345 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:39,345 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-10-22 09:00:39,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:39,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:39,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:39,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,347 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-10-22 09:00:39,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:39,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:39,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:39,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,349 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-10-22 09:00:39,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:39,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:39,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:39,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,352 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-10-22 09:00:39,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:39,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:39,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:39,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,354 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-10-22 09:00:39,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:39,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,355 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:39,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:39,357 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:39,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:39,359 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:39,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:39,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:39,360 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:39,360 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2019-10-22 09:00:39,360 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:39,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:39,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:39,425 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-10-22 09:00:39,426 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 251 states and 326 transitions. cyclomatic complexity: 87 Second operand 6 states. [2019-10-22 09:00:39,505 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-10-22 09:00:39,505 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-10-22 09:00:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2019-10-22 09:00:39,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2019-10-22 09:00:39,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2019-10-22 09:00:39,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2019-10-22 09:00:39,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 353 transitions. [2019-10-22 09:00:39,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 09:00:39,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 274 states and 352 transitions. [2019-10-22 09:00:39,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2019-10-22 09:00:39,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-10-22 09:00:39,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 352 transitions. [2019-10-22 09:00:39,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:39,512 INFO L688 BuchiCegarLoop]: Abstraction has 274 states and 352 transitions. [2019-10-22 09:00:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 352 transitions. [2019-10-22 09:00:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2019-10-22 09:00:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-22 09:00:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 338 transitions. [2019-10-22 09:00:39,519 INFO L711 BuchiCegarLoop]: Abstraction has 261 states and 338 transitions. [2019-10-22 09:00:39,519 INFO L591 BuchiCegarLoop]: Abstraction has 261 states and 338 transitions. [2019-10-22 09:00:39,519 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:39,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 338 transitions. [2019-10-22 09:00:39,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 09:00:39,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:39,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:39,521 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-10-22 09:00:39,521 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:39,522 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); 4497#L59 assume 2 == ~n;#res := 1; 4496#is_prime_FINAL assume true; 4494#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; 4502#L16 assume ~m < 0; 4426#L17 [2019-10-22 09:00:39,522 INFO L793 eck$LassoCheckResult]: Loop: 4426#L17 call #t~ret0 := mult(~n, -~m);< 4427#multENTRY ~n := #in~n;~m := #in~m; 4503#L16 assume ~m < 0; 4426#L17 [2019-10-22 09:00:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2019-10-22 09:00:39,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123487651] [2019-10-22 09:00:39,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:39,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123487651] [2019-10-22 09:00:39,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:39,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:39,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055765487] [2019-10-22 09:00:39,557 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2019-10-22 09:00:39,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931685829] [2019-10-22 09:00:39,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,561 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:39,600 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:39,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:39,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:39,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:39,601 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:39,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:39,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:39,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2019-10-22 09:00:39,601 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:39,601 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:39,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,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-10-22 09:00:39,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-10-22 09:00:39,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:39,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:39,648 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:39,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,655 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,658 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,658 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:39,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,664 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:39,667 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,667 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:39,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,673 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-10-22 09:00:39,678 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:39,679 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:39,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:39,687 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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) [2019-10-22 09:00:39,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:39,698 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:40,348 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:40,349 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:40,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:40,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:40,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:40,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:40,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:40,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:40,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:40,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2019-10-22 09:00:40,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:40,350 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:40,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,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-10-22 09:00:40,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-10-22 09:00:40,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,414 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:40,414 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:40,414 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-10-22 09:00:40,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,416 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-10-22 09:00:40,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,417 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,419 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-10-22 09:00:40,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:40,421 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-10-22 09:00:40,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:40,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:40,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:40,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:40,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:40,422 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:40,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:40,424 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:40,425 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-10-22 09:00:40,426 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:40,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:40,426 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:40,426 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:40,426 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2019-10-22 09:00:40,427 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:40,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:40,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:40,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:40,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:40,495 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-10-22 09:00:40,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 338 transitions. cyclomatic complexity: 90 Second operand 5 states. [2019-10-22 09:00:40,571 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-10-22 09:00:40,571 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-10-22 09:00:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-10-22 09:00:40,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 09:00:40,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2019-10-22 09:00:40,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2019-10-22 09:00:40,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:40,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 384 transitions. [2019-10-22 09:00:40,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-10-22 09:00:40,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 292 states and 374 transitions. [2019-10-22 09:00:40,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2019-10-22 09:00:40,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-10-22 09:00:40,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2019-10-22 09:00:40,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:40,579 INFO L688 BuchiCegarLoop]: Abstraction has 292 states and 374 transitions. [2019-10-22 09:00:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2019-10-22 09:00:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 279. [2019-10-22 09:00:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-22 09:00:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 360 transitions. [2019-10-22 09:00:40,586 INFO L711 BuchiCegarLoop]: Abstraction has 279 states and 360 transitions. [2019-10-22 09:00:40,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:40,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:40,586 INFO L87 Difference]: Start difference. First operand 279 states and 360 transitions. Second operand 6 states. [2019-10-22 09:00:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:40,614 INFO L93 Difference]: Finished difference Result 275 states and 351 transitions. [2019-10-22 09:00:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:40,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 351 transitions. [2019-10-22 09:00:40,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:00:40,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 196 states and 236 transitions. [2019-10-22 09:00:40,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-10-22 09:00:40,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-10-22 09:00:40,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2019-10-22 09:00:40,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:40,619 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2019-10-22 09:00:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2019-10-22 09:00:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2019-10-22 09:00:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-22 09:00:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2019-10-22 09:00:40,623 INFO L711 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-10-22 09:00:40,623 INFO L591 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-10-22 09:00:40,623 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:40,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2019-10-22 09:00:40,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-10-22 09:00:40,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:40,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:40,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:40,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:40,625 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-10-22 09:00:40,625 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-10-22 09:00:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2019-10-22 09:00:40,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:40,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194566935] [2019-10-22 09:00:40,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:40,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194566935] [2019-10-22 09:00:40,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84105075] [2019-10-22 09:00:40,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:40,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:40,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:40,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:40,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-10-22 09:00:40,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347003640] [2019-10-22 09:00:40,728 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2019-10-22 09:00:40,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:40,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373928450] [2019-10-22 09:00:40,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:40,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:40,734 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:40,800 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:40,801 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:40,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:40,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:40,801 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:40,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:40,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:40,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:40,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration10_Loop [2019-10-22 09:00:40,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:40,801 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:40,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:40,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:40,855 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:40,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:40,861 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:40,861 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/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:40,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:40,865 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/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-10-22 09:00:40,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:40,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:42,981 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:42,983 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:42,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:42,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:42,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:42,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:42,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:42,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:42,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:42,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration10_Loop [2019-10-22 09:00:42,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:42,984 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:42,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:42,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:42,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:42,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:42,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:43,039 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:43,039 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:43,039 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-10-22 09:00:43,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:43,039 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:43,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:43,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:43,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:43,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:43,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:43,041 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:43,045 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:43,046 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:00:43,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:43,046 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:43,046 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:43,046 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2019-10-22 09:00:43,047 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:43,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:43,155 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-10-22 09:00:43,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-10-22 09:00:43,248 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-10-22 09:00:43,250 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-10-22 09:00:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-10-22 09:00:43,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2019-10-22 09:00:43,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,251 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:43,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:43,336 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-10-22 09:00:43,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-10-22 09:00:43,438 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-10-22 09:00:43,439 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-10-22 09:00:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-10-22 09:00:43,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2019-10-22 09:00:43,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,439 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:00:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:43,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:00:43,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:43,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:43,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:43,538 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-10-22 09:00:43,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-10-22 09:00:43,655 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-10-22 09:00:43,659 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-10-22 09:00:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2019-10-22 09:00:43,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2019-10-22 09:00:43,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2019-10-22 09:00:43,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2019-10-22 09:00:43,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:43,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2019-10-22 09:00:43,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-10-22 09:00:43,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2019-10-22 09:00:43,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-10-22 09:00:43,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-10-22 09:00:43,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2019-10-22 09:00:43,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:43,667 INFO L688 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-10-22 09:00:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2019-10-22 09:00:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2019-10-22 09:00:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-22 09:00:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2019-10-22 09:00:43,690 INFO L711 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2019-10-22 09:00:43,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:00:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:00:43,693 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2019-10-22 09:00:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:43,804 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2019-10-22 09:00:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:00:43,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2019-10-22 09:00:43,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-10-22 09:00:43,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2019-10-22 09:00:43,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-10-22 09:00:43,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-10-22 09:00:43,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2019-10-22 09:00:43,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:43,810 INFO L688 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2019-10-22 09:00:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2019-10-22 09:00:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2019-10-22 09:00:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-22 09:00:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2019-10-22 09:00:43,817 INFO L711 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2019-10-22 09:00:43,817 INFO L591 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2019-10-22 09:00:43,817 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:43,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2019-10-22 09:00:43,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-10-22 09:00:43,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:43,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:43,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:43,819 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-10-22 09:00:43,819 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-10-22 09:00:43,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2019-10-22 09:00:43,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026445316] [2019-10-22 09:00:43,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:43,837 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2019-10-22 09:00:43,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609488475] [2019-10-22 09:00:43,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:43,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2019-10-22 09:00:43,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:43,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021201088] [2019-10-22 09:00:43,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:43,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:43,870 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:44,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:44 BoogieIcfgContainer [2019-10-22 09:00:44,347 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:44,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:44,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:44,348 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:44,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:32" (3/4) ... [2019-10-22 09:00:44,351 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:00:44,383 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ede77c6-46fb-4e9f-852d-9bd2981f5b52/bin/uautomizer/witness.graphml [2019-10-22 09:00:44,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:44,385 INFO L168 Benchmark]: Toolchain (without parser) took 12884.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,385 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:44,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.60 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-10-22 09:00:44,388 INFO L168 Benchmark]: Boogie Preprocessor took 17.86 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,388 INFO L168 Benchmark]: RCFGBuilder took 405.81 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,389 INFO L168 Benchmark]: BuchiAutomizer took 12116.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -40.0 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:44,389 INFO L168 Benchmark]: Witness Printer took 35.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 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-10-22 09:00:44,391 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.72 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.60 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 17.86 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 405.81 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12116.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -40.0 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. * Witness Printer took 35.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 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 12.0s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 8.7s. Construction of modules took 0.8s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 304 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 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, 0.8s 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: 13ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.4s - 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@3b175c09=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61b7f65f=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@727dc433=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a4653d=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17bc3eec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39017238=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@197f5982=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5365eb02=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@469a3b8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17ac8180=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@457dd020=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@cab563c=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...