./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82151ec4435da78821025b3100fe51201edc8f02 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:15:26,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:15:26,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:15:26,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:15:26,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:15:26,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:15:26,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:15:26,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:15:26,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:15:26,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:15:26,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:15:26,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:15:26,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:15:26,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:15:26,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:15:26,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:15:26,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:15:26,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:15:26,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:15:26,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:15:26,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:15:26,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:15:26,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:15:26,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:15:26,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:15:26,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:15:26,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:15:26,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:15:26,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:15:26,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:15:26,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:15:26,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:15:26,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:15:26,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:15:26,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:15:26,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:15:26,417 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:15:26,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:15:26,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:15:26,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:15:26,428 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:15:26,428 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:15:26,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:15:26,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:15:26,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:15:26,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:15:26,431 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:15:26,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:15:26,431 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:15:26,431 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:15:26,431 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:15:26,432 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82151ec4435da78821025b3100fe51201edc8f02 [2018-11-23 07:15:26,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:15:26,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:15:26,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:15:26,463 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:15:26,463 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:15:26,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-23 07:15:26,503 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/data/56fabab3e/d6264cf7f36a4ff8af88a054c7f1dbcd/FLAGbbfc949f7 [2018-11-23 07:15:26,933 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:15:26,933 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-23 07:15:26,939 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/data/56fabab3e/d6264cf7f36a4ff8af88a054c7f1dbcd/FLAGbbfc949f7 [2018-11-23 07:15:26,950 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/data/56fabab3e/d6264cf7f36a4ff8af88a054c7f1dbcd [2018-11-23 07:15:26,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:15:26,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:15:26,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:15:26,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:15:26,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:15:26,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:15:26" (1/1) ... [2018-11-23 07:15:26,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47777997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:26, skipping insertion in model container [2018-11-23 07:15:26,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:15:26" (1/1) ... [2018-11-23 07:15:26,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:15:26,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:15:27,115 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:15:27,118 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:15:27,133 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:15:27,142 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:15:27,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27 WrapperNode [2018-11-23 07:15:27,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:15:27,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:15:27,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:15:27,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:15:27,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:15:27,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:15:27,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:15:27,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:15:27,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... [2018-11-23 07:15:27,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:15:27,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:15:27,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:15:27,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:15:27,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2018-11-23 07:15:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2018-11-23 07:15:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-23 07:15:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-23 07:15:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:15:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:15:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2018-11-23 07:15:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2018-11-23 07:15:27,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:15:27,422 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 07:15:27,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:15:27 BoogieIcfgContainer [2018-11-23 07:15:27,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:15:27,423 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:15:27,423 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:15:27,426 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:15:27,426 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:15:27,426 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:15:26" (1/3) ... [2018-11-23 07:15:27,427 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fa27858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:15:27, skipping insertion in model container [2018-11-23 07:15:27,427 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:15:27,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:15:27" (2/3) ... [2018-11-23 07:15:27,428 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fa27858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:15:27, skipping insertion in model container [2018-11-23 07:15:27,428 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:15:27,428 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:15:27" (3/3) ... [2018-11-23 07:15:27,430 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-23 07:15:27,471 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:15:27,471 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:15:27,471 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:15:27,471 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:15:27,471 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:15:27,472 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:15:27,472 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:15:27,472 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:15:27,472 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:15:27,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-23 07:15:27,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-23 07:15:27,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:27,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:27,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:15:27,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:27,505 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:15:27,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-23 07:15:27,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-23 07:15:27,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:27,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:27,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:15:27,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:27,514 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 13#L76true assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 10#L51true call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 12#is_prime_ENTRYtrue [2018-11-23 07:15:27,514 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 41#L56true assume !(~n <= 1); 35#L59true assume !(2 == ~n); 25#L62true assume ~n > 2; 39#L63true assume !(~m <= 1); 32#L66true call #t~ret6 := multiple_of(~n, ~m);< 51#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 31#L30true assume !(~m < 0); 24#L33true assume !(~n < 0); 37#L36true assume 0 == ~m;#res := 0; 27#multiple_ofFINALtrue assume true; 46#multiple_ofEXITtrue >#121#return; 30#L66-1true assume !(0 == #t~ret6);havoc #t~ret6; 23#L69true call #t~ret7 := is_prime_(~n, ~m - 1);< 12#is_prime_ENTRYtrue [2018-11-23 07:15:27,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2018-11-23 07:15:27,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2018-11-23 07:15:27,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:27,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:15:27,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:15:27,662 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:15:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:15:27,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:15:27,673 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-23 07:15:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:27,768 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-11-23 07:15:27,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:15:27,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2018-11-23 07:15:27,772 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-23 07:15:27,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2018-11-23 07:15:27,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-23 07:15:27,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-23 07:15:27,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-11-23 07:15:27,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:15:27,781 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-23 07:15:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-11-23 07:15:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 07:15:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 07:15:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-23 07:15:27,809 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-11-23 07:15:27,809 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-11-23 07:15:27,809 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:15:27,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2018-11-23 07:15:27,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-23 07:15:27,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:27,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:27,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:15:27,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:27,811 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 143#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 132#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 140#is_prime_ENTRY [2018-11-23 07:15:27,812 INFO L796 eck$LassoCheckResult]: Loop: 140#is_prime_ENTRY ~n := #in~n;~m := #in~m; 141#L56 assume !(~n <= 1); 131#L59 assume !(2 == ~n); 135#L62 assume ~n > 2; 142#L63 assume !(~m <= 1); 118#L66 call #t~ret6 := multiple_of(~n, ~m);< 128#multiple_ofENTRY ~n := #in~n;~m := #in~m; 153#L30 assume !(~m < 0); 149#L33 assume !(~n < 0); 138#L36 assume !(0 == ~m); 139#L39 assume 0 == ~n;#res := 1; 122#multiple_ofFINAL assume true; 150#multiple_ofEXIT >#121#return; 151#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 133#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 140#is_prime_ENTRY [2018-11-23 07:15:27,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2018-11-23 07:15:27,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2018-11-23 07:15:27,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:15:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:27,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:15:27,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:15:27,851 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:15:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:15:27,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:15:27,852 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-23 07:15:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:27,913 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-11-23 07:15:27,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:15:27,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-11-23 07:15:27,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-23 07:15:27,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2018-11-23 07:15:27,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 07:15:27,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 07:15:27,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2018-11-23 07:15:27,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:15:27,918 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2018-11-23 07:15:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2018-11-23 07:15:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 07:15:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 07:15:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-11-23 07:15:27,920 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-23 07:15:27,921 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-23 07:15:27,921 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:15:27,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2018-11-23 07:15:27,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-23 07:15:27,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:27,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:27,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 07:15:27,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:27,923 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 233#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 222#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 230#is_prime_ENTRY [2018-11-23 07:15:27,923 INFO L796 eck$LassoCheckResult]: Loop: 230#is_prime_ENTRY ~n := #in~n;~m := #in~m; 231#L56 assume !(~n <= 1); 221#L59 assume !(2 == ~n); 225#L62 assume ~n > 2; 232#L63 assume !(~m <= 1); 208#L66 call #t~ret6 := multiple_of(~n, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume !(0 == ~n); 209#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume 0 == ~n;#res := 1; 212#multiple_ofFINAL assume true; 241#multiple_ofEXIT >#111#return; 234#L42-1 #res := #t~ret4;havoc #t~ret4; 235#multiple_ofFINAL assume true; 246#multiple_ofEXIT >#121#return; 243#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 223#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 230#is_prime_ENTRY [2018-11-23 07:15:27,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2018-11-23 07:15:27,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2018-11-23 07:15:27,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:15:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:27,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2018-11-23 07:15:27,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:15:28,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:15:28,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:15:28,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:28,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:15:28,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:15:28,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 07:15:28,380 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:28,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:28,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:28,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:28,381 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:28,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:28,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:28,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-23 07:15:28,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:28,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:28,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,450 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:28,451 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:28,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:28,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:28,459 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:28,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:28,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:28,479 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:28,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:28,497 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:28,497 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret6=0} Honda state: {is_prime__#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:28,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:28,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:28,514 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret7=0} Honda state: {is_prime__#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:28,529 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:28,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:28,594 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:28,595 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:28,595 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:28,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:28,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:28,595 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:28,596 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:28,596 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:28,596 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:28,596 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-23 07:15:28,596 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:28,596 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:28,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:28,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:28,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:28,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:28,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:28,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:28,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:28,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:28,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:28,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:28,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:28,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:28,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:28,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:28,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:28,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:28,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:28,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:28,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:28,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:28,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:28,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:28,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:28,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:28,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:28,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:28,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:28,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:28,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:28,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:28,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:28,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:28,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:28,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:28,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:28,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:28,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:28,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:28,701 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:28,708 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 07:15:28,708 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 07:15:28,710 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:28,710 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:28,710 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:28,710 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2018-11-23 07:15:28,711 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:28,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:28,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:28,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:15:28,846 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-23 07:15:28,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-23 07:15:29,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 174 states and 238 transitions. Complement of second has 40 states. [2018-11-23 07:15:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 07:15:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-23 07:15:29,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2018-11-23 07:15:29,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:29,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2018-11-23 07:15:29,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:29,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2018-11-23 07:15:29,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:29,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2018-11-23 07:15:29,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-23 07:15:29,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2018-11-23 07:15:29,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-23 07:15:29,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-23 07:15:29,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2018-11-23 07:15:29,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:29,115 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2018-11-23 07:15:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2018-11-23 07:15:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2018-11-23 07:15:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 07:15:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2018-11-23 07:15:29,126 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2018-11-23 07:15:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:15:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:15:29,127 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 9 states. [2018-11-23 07:15:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:29,302 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2018-11-23 07:15:29,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:15:29,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2018-11-23 07:15:29,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-23 07:15:29,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2018-11-23 07:15:29,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-23 07:15:29,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-23 07:15:29,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2018-11-23 07:15:29,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:29,310 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2018-11-23 07:15:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2018-11-23 07:15:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-11-23 07:15:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 07:15:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2018-11-23 07:15:29,319 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-23 07:15:29,319 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-23 07:15:29,319 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:15:29,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2018-11-23 07:15:29,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-23 07:15:29,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:29,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:29,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:29,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:15:29,322 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 965#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 942#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 957#is_prime_ENTRY ~n := #in~n;~m := #in~m; 959#L56 assume !(~n <= 1); 941#L59 assume !(2 == ~n); 944#L62 assume ~n > 2; 962#L63 assume !(~m <= 1); 936#L66 call #t~ret6 := multiple_of(~n, ~m);< 994#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1022#L30 assume ~m < 0; 969#L31 [2018-11-23 07:15:29,322 INFO L796 eck$LassoCheckResult]: Loop: 969#L31 call #t~ret2 := multiple_of(~n, -~m);< 973#multiple_ofENTRY ~n := #in~n;~m := #in~m; 990#L30 assume ~m < 0; 969#L31 [2018-11-23 07:15:29,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2018-11-23 07:15:29,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:29,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:29,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:15:29,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:15:29,341 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:15:29,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2018-11-23 07:15:29,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:29,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:29,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:29,375 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:29,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:29,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:29,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:29,375 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:29,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:29,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:29,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-23 07:15:29,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:29,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:29,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:29,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:29,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:29,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:29,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:29,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:29,430 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:29,432 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:29,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:29,435 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret4=0} Honda state: {multiple_of_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:29,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:29,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:29,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=4, multiple_of_#in~n=4} Honda state: {multiple_of_~n=4, multiple_of_#in~n=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:29,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:29,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:29,472 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:29,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:29,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:29,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:29,507 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:29,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:29,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,115 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:30,116 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:30,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:30,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:30,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:30,117 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:30,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:30,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:30,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-23 07:15:30,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:30,117 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:30,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,152 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:30,152 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:30,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,163 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:30,164 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-23 07:15:30,164 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:15:30,165 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:30,165 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:30,165 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:30,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2018-11-23 07:15:30,165 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:30,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:30,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:30,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:30,202 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 07:15:30,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-23 07:15:30,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 209 states and 271 transitions. Complement of second has 18 states. [2018-11-23 07:15:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:15:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-23 07:15:30,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-23 07:15:30,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:30,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 07:15:30,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:30,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-23 07:15:30,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:30,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2018-11-23 07:15:30,261 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2018-11-23 07:15:30,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2018-11-23 07:15:30,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-23 07:15:30,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-23 07:15:30,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2018-11-23 07:15:30,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:30,265 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2018-11-23 07:15:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2018-11-23 07:15:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-11-23 07:15:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 07:15:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2018-11-23 07:15:30,273 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2018-11-23 07:15:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:15:30,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:15:30,273 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2018-11-23 07:15:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:30,317 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-23 07:15:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:15:30,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2018-11-23 07:15:30,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 07:15:30,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2018-11-23 07:15:30,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-23 07:15:30,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-23 07:15:30,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2018-11-23 07:15:30,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:30,323 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2018-11-23 07:15:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2018-11-23 07:15:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-11-23 07:15:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 07:15:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-11-23 07:15:30,330 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-23 07:15:30,330 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-23 07:15:30,330 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:15:30,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2018-11-23 07:15:30,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 07:15:30,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:30,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:30,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:30,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:15:30,332 INFO L794 eck$LassoCheckResult]: Stem: 1623#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 1605#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 1585#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1597#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1599#L56 assume ~n <= 1;#res := 0; 1586#is_prime_FINAL assume true; 1632#is_prime_EXIT >#117#return; 1592#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1582#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 1583#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1615#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 1616#L95 assume main_#t~short13; 1575#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1591#multENTRY [2018-11-23 07:15:30,332 INFO L796 eck$LassoCheckResult]: Loop: 1591#multENTRY ~n := #in~n;~m := #in~m; 1573#L16 assume ~m < 0; 1576#L17 call #t~ret0 := mult(~n, -~m);< 1591#multENTRY [2018-11-23 07:15:30,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2018-11-23 07:15:30,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:30,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:15:30,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:15:30,383 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:15:30,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2018-11-23 07:15:30,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:30,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:30,414 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:30,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:30,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:30,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:30,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:30,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:30,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:30,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-23 07:15:30,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:30,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:30,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:30,452 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,461 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,481 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,481 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,499 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,516 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,533 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,549 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,550 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,565 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:30,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,601 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:30,603 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:30,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:30,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:30,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:30,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:30,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:30,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:30,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-23 07:15:30,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:30,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:30,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:30,627 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:30,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:30,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:30,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:30,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:30,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:30,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:30,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:30,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:30,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:30,640 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:30,641 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-23 07:15:30,642 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:15:30,642 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:30,642 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:30,642 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:30,642 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2018-11-23 07:15:30,643 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:30,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:30,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:30,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:30,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 07:15:30,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2018-11-23 07:15:30,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34. Second operand 5 states. Result 142 states and 176 transitions. Complement of second has 14 states. [2018-11-23 07:15:30,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 07:15:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 07:15:30,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 07:15:30,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:30,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-23 07:15:30,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:30,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-23 07:15:30,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:30,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2018-11-23 07:15:30,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 07:15:30,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2018-11-23 07:15:30,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-23 07:15:30,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-23 07:15:30,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2018-11-23 07:15:30,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:30,787 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2018-11-23 07:15:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2018-11-23 07:15:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-11-23 07:15:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 07:15:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2018-11-23 07:15:30,793 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2018-11-23 07:15:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:15:30,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:15:30,793 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2018-11-23 07:15:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:30,837 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2018-11-23 07:15:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:15:30,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2018-11-23 07:15:30,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 07:15:30,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2018-11-23 07:15:30,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-23 07:15:30,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-23 07:15:30,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2018-11-23 07:15:30,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:30,842 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-23 07:15:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2018-11-23 07:15:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 07:15:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 07:15:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2018-11-23 07:15:30,848 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-11-23 07:15:30,848 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-11-23 07:15:30,848 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:15:30,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2018-11-23 07:15:30,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 07:15:30,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:30,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:30,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:30,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 07:15:30,850 INFO L794 eck$LassoCheckResult]: Stem: 2228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 2206#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 2185#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2195#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2198#L56 assume !(~n <= 1); 2241#L59 assume !(2 == ~n); 2242#L62 assume ~n > 2; 2202#L63 assume !(~m <= 1); 2173#L66 call #t~ret6 := multiple_of(~n, ~m);< 2233#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2231#L30 assume !(~m < 0); 2219#L33 assume ~n < 0; 2160#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2018-11-23 07:15:30,851 INFO L796 eck$LassoCheckResult]: Loop: 2175#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2235#L30 assume !(~m < 0); 2260#L33 assume ~n < 0; 2161#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2018-11-23 07:15:30,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:30,851 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2018-11-23 07:15:30,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:30,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:15:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:15:30,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:15:30,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2018-11-23 07:15:30,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:30,943 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:30,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:30,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:30,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:30,943 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:30,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:30,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:30,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-23 07:15:30,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:30,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:30,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:30,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:30,974 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:30,979 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:30,979 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:30,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:30,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:31,001 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:31,018 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,034 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:31,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,069 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:31,071 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:31,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:31,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:31,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:31,071 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:31,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:31,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:31,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-23 07:15:31,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:31,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:31,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,107 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:31,107 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:31,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:31,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:31,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:31,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:31,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:31,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:31,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:31,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:31,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:31,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:31,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:31,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:31,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:31,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:31,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:31,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:31,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:31,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:31,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:31,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:31,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:31,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:31,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:31,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:31,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:31,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:31,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:31,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:31,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:31,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:31,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:31,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:31,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:31,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:31,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:31,115 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:31,116 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-23 07:15:31,116 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:15:31,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:31,117 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:31,117 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:31,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2018-11-23 07:15:31,117 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:31,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:31,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:31,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:31,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 07:15:31,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-23 07:15:31,209 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 270 states and 352 transitions. Complement of second has 13 states. [2018-11-23 07:15:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 07:15:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-23 07:15:31,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-23 07:15:31,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:31,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-23 07:15:31,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:31,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 07:15:31,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:31,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2018-11-23 07:15:31,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-23 07:15:31,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2018-11-23 07:15:31,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-23 07:15:31,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-23 07:15:31,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2018-11-23 07:15:31,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:31,220 INFO L705 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2018-11-23 07:15:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2018-11-23 07:15:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2018-11-23 07:15:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-23 07:15:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2018-11-23 07:15:31,228 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2018-11-23 07:15:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:15:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:15:31,228 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2018-11-23 07:15:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:31,273 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2018-11-23 07:15:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:15:31,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 279 transitions. [2018-11-23 07:15:31,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-23 07:15:31,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 279 transitions. [2018-11-23 07:15:31,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-23 07:15:31,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-23 07:15:31,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 279 transitions. [2018-11-23 07:15:31,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:31,278 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-23 07:15:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 279 transitions. [2018-11-23 07:15:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-11-23 07:15:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-23 07:15:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2018-11-23 07:15:31,288 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-23 07:15:31,289 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-23 07:15:31,289 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:15:31,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 279 transitions. [2018-11-23 07:15:31,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-23 07:15:31,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:31,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:31,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:31,291 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:15:31,291 INFO L794 eck$LassoCheckResult]: Stem: 3156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3126#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3114#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3115#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3118#L56 assume !(~n <= 1); 3171#L59 assume !(2 == ~n); 3172#L62 assume ~n > 2; 3173#L63 assume !(~m <= 1); 3161#L66 call #t~ret6 := multiple_of(~n, ~m);< 3168#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3160#L30 assume !(~m < 0); 3162#L33 assume !(~n < 0); 3226#L36 assume !(0 == ~m); 3224#L39 assume !(0 == ~n); 3072#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2018-11-23 07:15:31,291 INFO L796 eck$LassoCheckResult]: Loop: 3194#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3192#L30 assume !(~m < 0); 3186#L33 assume !(~n < 0); 3187#L36 assume !(0 == ~m); 3225#L39 assume !(0 == ~n); 3071#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2018-11-23 07:15:31,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2018-11-23 07:15:31,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:31,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2018-11-23 07:15:31,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:31,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:31,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:31,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2018-11-23 07:15:31,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,362 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:31,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:31,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:31,362 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:31,362 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:31,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:31,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:31,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-23 07:15:31,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:31,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:31,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:31,408 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,415 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:31,415 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,430 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:31,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,526 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:31,527 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:31,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:31,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:31,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:31,528 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:31,528 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:31,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:31,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-23 07:15:31,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:31,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:31,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,577 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:31,577 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:31,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:31,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:31,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:31,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:31,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:31,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:31,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:31,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:31,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:31,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:31,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:31,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:31,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:31,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:31,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:31,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:31,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:31,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:31,585 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:15:31,585 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:15:31,585 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:31,586 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:31,586 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:31,586 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2018-11-23 07:15:31,586 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:31,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:31,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:31,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:31,650 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 07:15:31,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75 Second operand 6 states. [2018-11-23 07:15:31,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75. Second operand 6 states. Result 313 states and 413 transitions. Complement of second has 21 states. [2018-11-23 07:15:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:15:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 07:15:31,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 07:15:31,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:31,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-23 07:15:31,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:31,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2018-11-23 07:15:31,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:31,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 413 transitions. [2018-11-23 07:15:31,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-23 07:15:31,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 282 states and 365 transitions. [2018-11-23 07:15:31,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-23 07:15:31,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-23 07:15:31,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 365 transitions. [2018-11-23 07:15:31,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:31,739 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 365 transitions. [2018-11-23 07:15:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 365 transitions. [2018-11-23 07:15:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 249. [2018-11-23 07:15:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 07:15:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 323 transitions. [2018-11-23 07:15:31,747 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-11-23 07:15:31,747 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-11-23 07:15:31,747 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 07:15:31,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 323 transitions. [2018-11-23 07:15:31,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-23 07:15:31,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:31,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:31,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:31,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 07:15:31,749 INFO L794 eck$LassoCheckResult]: Stem: 3796#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3765#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3753#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3754#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3757#L56 assume !(~n <= 1); 3845#L59 assume 2 == ~n;#res := 1; 3843#is_prime_FINAL assume true; 3810#is_prime_EXIT >#117#return; 3746#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3732#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 3733#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3775#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 3776#L95 assume main_#t~short13; 3721#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3755#multENTRY ~n := #in~n;~m := #in~m; 3720#L16 assume !(~m < 0); 3723#L19 [2018-11-23 07:15:31,749 INFO L796 eck$LassoCheckResult]: Loop: 3723#L19 assume !(0 == ~m); 3771#L22 assume !(1 == ~m); 3743#L25 call #t~ret1 := mult(~n, ~m - 1);< 3745#multENTRY ~n := #in~n;~m := #in~m; 3782#L16 assume !(~m < 0); 3723#L19 [2018-11-23 07:15:31,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2018-11-23 07:15:31,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:31,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:15:31,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2018-11-23 07:15:31,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2018-11-23 07:15:31,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:31,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:31,825 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:31,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:31,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:31,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:31,825 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:31,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:31,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:31,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-23 07:15:31,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:31,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:31,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:31,862 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:31,862 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:31,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:31,884 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:31,884 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:31,899 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:31,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:31,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:32,632 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:32,633 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:32,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:32,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:32,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:32,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:32,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:32,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:32,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:32,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-23 07:15:32,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:32,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:32,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:32,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:32,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:32,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:32,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:32,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:32,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:32,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:32,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:32,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:32,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:32,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:32,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:32,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:32,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:32,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:32,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:32,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:32,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:32,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:32,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:32,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:32,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:32,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:32,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:32,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:32,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:32,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:32,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:32,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:32,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:32,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:32,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:32,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:32,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:32,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:32,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:32,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:32,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:32,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:32,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:32,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:32,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:32,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:32,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:32,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:32,693 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:32,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:15:32,694 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:15:32,695 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:32,695 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:32,695 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:32,695 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-23 07:15:32,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:32,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:32,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:32,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:32,769 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 07:15:32,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86 Second operand 6 states. [2018-11-23 07:15:32,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86. Second operand 6 states. Result 273 states and 350 transitions. Complement of second has 17 states. [2018-11-23 07:15:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:15:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 07:15:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 07:15:32,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-23 07:15:32,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-23 07:15:32,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:32,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 350 transitions. [2018-11-23 07:15:32,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-23 07:15:32,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 272 states and 349 transitions. [2018-11-23 07:15:32,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-23 07:15:32,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-23 07:15:32,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 349 transitions. [2018-11-23 07:15:32,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:32,842 INFO L705 BuchiCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-11-23 07:15:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 349 transitions. [2018-11-23 07:15:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-11-23 07:15:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-23 07:15:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 335 transitions. [2018-11-23 07:15:32,848 INFO L728 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-11-23 07:15:32,848 INFO L608 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-11-23 07:15:32,848 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 07:15:32,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 335 transitions. [2018-11-23 07:15:32,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-23 07:15:32,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:32,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:32,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:32,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 07:15:32,850 INFO L794 eck$LassoCheckResult]: Stem: 4428#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 4393#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 4380#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4381#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4384#L56 assume !(~n <= 1); 4444#L59 assume 2 == ~n;#res := 1; 4443#is_prime_FINAL assume true; 4441#is_prime_EXIT >#117#return; 4373#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4357#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 4358#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4407#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4408#L95 assume main_#t~short13; 4348#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4382#multENTRY ~n := #in~n;~m := #in~m; 4345#L16 assume !(~m < 0); 4347#L19 assume !(0 == ~m); 4401#L22 assume !(1 == ~m); 4409#L25 call #t~ret1 := mult(~n, ~m - 1);< 4590#multENTRY ~n := #in~n;~m := #in~m; 4449#L16 assume ~m < 0; 4369#L17 [2018-11-23 07:15:32,850 INFO L796 eck$LassoCheckResult]: Loop: 4369#L17 call #t~ret0 := mult(~n, -~m);< 4370#multENTRY ~n := #in~n;~m := #in~m; 4450#L16 assume ~m < 0; 4369#L17 [2018-11-23 07:15:32,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2018-11-23 07:15:32,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:32,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:32,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:15:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:15:32,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:15:32,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2018-11-23 07:15:32,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:32,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:32,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:32,922 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:32,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:32,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:32,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:32,922 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:32,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:32,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:32,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:32,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-23 07:15:32,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:32,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:32,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:32,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:32,964 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:32,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:32,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:32,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:32,969 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:32,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:32,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:32,987 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:32,987 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:33,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:33,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:33,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:33,006 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0, mult_#in~n=0} Honda state: {mult_~n=0, mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:33,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:33,022 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:33,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:33,043 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:33,975 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:33,976 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:33,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:33,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:33,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:33,976 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:33,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:33,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:33,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:33,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-23 07:15:33,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:33,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:33,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:33,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:33,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:33,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:33,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:34,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:34,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:34,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:34,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:34,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:34,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:34,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:34,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:34,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:34,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:34,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:34,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:34,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:34,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:34,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:34,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:34,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:34,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:34,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:34,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:34,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:34,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:34,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:34,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:34,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:34,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:34,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:34,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:34,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:15:34,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:34,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:34,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:34,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:34,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:34,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:34,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:34,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:34,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:34,014 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-23 07:15:34,014 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 07:15:34,014 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:34,014 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:34,015 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:34,015 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-23 07:15:34,015 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:34,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:34,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:34,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:34,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 07:15:34,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89 Second operand 5 states. [2018-11-23 07:15:34,107 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89. Second operand 5 states. Result 300 states and 381 transitions. Complement of second has 11 states. [2018-11-23 07:15:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 07:15:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 07:15:34,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-23 07:15:34,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:34,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-23 07:15:34,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:34,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-23 07:15:34,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:34,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 381 transitions. [2018-11-23 07:15:34,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-23 07:15:34,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 290 states and 371 transitions. [2018-11-23 07:15:34,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-23 07:15:34,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-23 07:15:34,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 371 transitions. [2018-11-23 07:15:34,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:34,113 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 371 transitions. [2018-11-23 07:15:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 371 transitions. [2018-11-23 07:15:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-11-23 07:15:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-23 07:15:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2018-11-23 07:15:34,117 INFO L728 BuchiCegarLoop]: Abstraction has 277 states and 357 transitions. [2018-11-23 07:15:34,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:15:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:15:34,118 INFO L87 Difference]: Start difference. First operand 277 states and 357 transitions. Second operand 5 states. [2018-11-23 07:15:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:34,155 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2018-11-23 07:15:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:15:34,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 348 transitions. [2018-11-23 07:15:34,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 07:15:34,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 196 states and 236 transitions. [2018-11-23 07:15:34,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-23 07:15:34,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-23 07:15:34,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2018-11-23 07:15:34,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:34,159 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2018-11-23 07:15:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2018-11-23 07:15:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2018-11-23 07:15:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 07:15:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2018-11-23 07:15:34,163 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-23 07:15:34,163 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-23 07:15:34,163 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 07:15:34,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2018-11-23 07:15:34,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 07:15:34,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:34,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:34,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:34,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 07:15:34,165 INFO L794 eck$LassoCheckResult]: Stem: 5597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 5598#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 5569#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5585#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5586#L56 assume !(~n <= 1); 5680#L59 assume !(2 == ~n); 5679#L62 assume ~n > 2; 5678#L63 assume !(~m <= 1); 5666#L66 call #t~ret6 := multiple_of(~n, ~m);< 5675#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5673#L30 assume !(~m < 0); 5671#L33 assume !(~n < 0); 5670#L36 assume !(0 == ~m); 5668#L39 assume !(0 == ~n); 5612#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5664#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5663#L30 assume !(~m < 0); 5712#L33 assume ~n < 0; 5555#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5692#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5606#L30 assume !(~m < 0); 5552#L33 assume !(~n < 0); 5554#L36 [2018-11-23 07:15:34,165 INFO L796 eck$LassoCheckResult]: Loop: 5554#L36 assume !(0 == ~m); 5582#L39 assume !(0 == ~n); 5574#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5573#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5711#L30 assume !(~m < 0); 5702#L33 assume !(~n < 0); 5554#L36 [2018-11-23 07:15:34,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2018-11-23 07:15:34,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:34,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:34,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:34,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:15:34,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:34,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:15:34,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:15:34,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:34,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:34,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:15:34,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 07:15:34,239 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:15:34,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2018-11-23 07:15:34,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:34,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:34,284 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:34,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:34,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:34,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:34,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:15:34,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:34,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:34,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:34,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-23 07:15:34,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:34,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:34,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:34,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:34,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:34,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:34,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:34,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:34,329 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:34,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:34,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:34,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:15:34,332 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:34,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:15:34,347 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:34,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:15:34,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:15:35,698 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:15:35,699 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:15:35,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:15:35,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:15:35,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:15:35,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:15:35,700 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:15:35,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:15:35,700 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:15:35,700 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-23 07:15:35,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:15:35,700 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:15:35,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:35,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:35,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:35,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:35,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:15:35,746 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:15:35,746 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:15:35,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:15:35,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:15:35,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:15:35,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:15:35,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:15:35,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:15:35,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:15:35,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:15:35,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 07:15:35,751 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 07:15:35,751 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 07:15:35,751 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 07:15:35,751 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 07:15:35,752 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 07:15:35,752 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2018-11-23 07:15:35,752 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 07:15:35,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:35,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:35,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:35,839 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 07:15:35,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-23 07:15:35,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2018-11-23 07:15:35,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:15:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 07:15:35,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 07:15:35,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:35,905 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:15:35,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:35,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:35,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:35,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 07:15:35,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-23 07:15:36,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2018-11-23 07:15:36,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:15:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 07:15:36,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 07:15:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:36,039 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 07:15:36,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:36,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:15:36,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:15:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:15:36,102 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 07:15:36,102 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-23 07:15:36,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 265 states and 319 transitions. Complement of second has 16 states. [2018-11-23 07:15:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 07:15:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 07:15:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-23 07:15:36,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 07:15:36,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:36,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2018-11-23 07:15:36,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:36,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2018-11-23 07:15:36,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 07:15:36,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2018-11-23 07:15:36,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-23 07:15:36,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2018-11-23 07:15:36,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 07:15:36,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-23 07:15:36,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2018-11-23 07:15:36,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:36,196 INFO L705 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2018-11-23 07:15:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2018-11-23 07:15:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2018-11-23 07:15:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-23 07:15:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2018-11-23 07:15:36,201 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2018-11-23 07:15:36,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:15:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:15:36,201 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2018-11-23 07:15:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:15:36,264 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-11-23 07:15:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:15:36,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2018-11-23 07:15:36,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 07:15:36,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2018-11-23 07:15:36,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-23 07:15:36,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 07:15:36,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2018-11-23 07:15:36,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 07:15:36,268 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2018-11-23 07:15:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2018-11-23 07:15:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2018-11-23 07:15:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 07:15:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2018-11-23 07:15:36,274 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-11-23 07:15:36,274 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-11-23 07:15:36,274 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 07:15:36,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2018-11-23 07:15:36,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 07:15:36,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:15:36,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:15:36,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:36,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:15:36,276 INFO L794 eck$LassoCheckResult]: Stem: 7270#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 7271#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 7233#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7255#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7256#L56 assume !(~n <= 1); 7278#L59 assume !(2 == ~n); 7261#L62 assume ~n > 2; 7262#L63 assume !(~m <= 1); 7251#L66 call #t~ret6 := multiple_of(~n, ~m);< 7282#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7275#L30 assume !(~m < 0); 7276#L33 assume !(~n < 0); 7250#L36 assume !(0 == ~m); 7252#L39 assume !(0 == ~n); 7266#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7335#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7334#L30 assume !(~m < 0); 7333#L33 assume !(~n < 0); 7330#L36 assume !(0 == ~m); 7265#L39 assume !(0 == ~n); 7241#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7289#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7319#L30 assume !(~m < 0); 7317#L33 assume ~n < 0; 7240#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7242#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7326#L30 assume !(~m < 0); 7325#L33 assume !(~n < 0); 7314#L36 [2018-11-23 07:15:36,276 INFO L796 eck$LassoCheckResult]: Loop: 7314#L36 assume !(0 == ~m); 7322#L39 assume !(0 == ~n); 7301#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7320#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7318#L30 assume !(~m < 0); 7300#L33 assume ~n < 0; 7302#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7316#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7315#L30 assume !(~m < 0); 7313#L33 assume !(~n < 0); 7314#L36 [2018-11-23 07:15:36,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2018-11-23 07:15:36,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:36,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:36,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:15:36,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:36,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2018-11-23 07:15:36,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:36,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:15:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:36,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:15:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2018-11-23 07:15:36,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:15:36,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:15:36,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:36,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:15:36,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:15:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:15:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] 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; [?] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [?] ~n := #in~n;~m := #in~m; [?] assume !(~n <= 1); [?] assume !(2 == ~n); [?] assume ~n > 2; [?] assume !(~m <= 1); [?] CALL call #t~ret6 := multiple_of(~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~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) ----- [2018-11-23 07:15:36,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:15:36 BoogieIcfgContainer [2018-11-23 07:15:36,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:15:36,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:15:36,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:15:36,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:15:36,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:15:27" (3/4) ... [2018-11-23 07:15:36,814 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] 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; [?] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [?] ~n := #in~n;~m := #in~m; [?] assume !(~n <= 1); [?] assume !(2 == ~n); [?] assume ~n > 2; [?] assume !(~m <= 1); [?] CALL call #t~ret6 := multiple_of(~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~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) ----- [2018-11-23 07:15:36,857 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c3030e2a-39eb-4389-b00d-28ef6ae62022/bin-2019/uautomizer/witness.graphml [2018-11-23 07:15:36,857 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:15:36,858 INFO L168 Benchmark]: Toolchain (without parser) took 9904.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 962.3 MB in the beginning and 1.2 GB in the end (delta: -254.6 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:15:36,859 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:15:36,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.90 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:15:36,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:15:36,859 INFO L168 Benchmark]: Boogie Preprocessor took 13.02 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:15:36,860 INFO L168 Benchmark]: RCFGBuilder took 248.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:15:36,860 INFO L168 Benchmark]: BuchiAutomizer took 9387.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.3 MB). Peak memory consumption was 466.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:15:36,860 INFO L168 Benchmark]: Witness Printer took 46.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:15:36,864 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.90 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.02 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 248.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9387.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.3 MB). Peak memory consumption was 466.3 MB. Max. memory is 11.5 GB. * Witness Printer took 46.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 7 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 9 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(n) and consists of 4 locations. One deterministic module has affine ranking function \old(n) and consists of 6 locations. One deterministic module has affine ranking function m and consists of 6 locations. One deterministic module has affine ranking function m and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 6.9s. Construction of modules took 0.6s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 300 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 259 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 694 SDtfs, 704 SDslu, 1147 SDs, 0 SdLazy, 884 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf99 lsp81 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq175 hnf92 smp90 dnf100 smp100 tf109 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.0s - 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@d88793=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b847cce=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12315b9d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@717cf17=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76e83791=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e5d523f=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@403adc44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3050507=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a6d9ebc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ca74b2a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e1db178=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@36501fd=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] 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; [?] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [?] ~n := #in~n;~m := #in~m; [?] assume !(~n <= 1); [?] assume !(2 == ~n); [?] assume ~n > 2; [?] assume !(~m <= 1); [?] CALL call #t~ret6 := multiple_of(~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] 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; [?] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [?] ~n := #in~n;~m := #in~m; [?] assume !(~n <= 1); [?] assume !(2 == ~n); [?] assume ~n > 2; [?] assume !(~m <= 1); [?] CALL call #t~ret6 := multiple_of(~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76-L80] assume !(main_~n~0 < 1 || main_~n~0 > 46340); [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56-L58] assume !(~n <= 1); [L59-L61] assume !(2 == ~n); [L62-L71] assume ~n > 2; [L63-L70] assume !(~m <= 1); [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] 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; [L75] main_~n~0 := main_#t~nondet8; [L75] havoc main_#t~nondet8; [L76] COND FALSE !(main_~n~0 < 1 || main_~n~0 > 46340) [L81] is_prime_#in~n := main_~n~0; [L81] havoc is_prime_#res; [L81] havoc is_prime_#t~ret5, is_prime_~n; [L50-L52] is_prime_~n := is_prime_#in~n; [L51] CALL call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L75] ~n~0 := #t~nondet8; [L75] havoc #t~nondet8; [L76] COND FALSE !(~n~0 < 1 || ~n~0 > 46340) [L50-L52] ~n := #in~n; [L51] CALL call #t~ret5 := is_prime_(~n, ~n - 1); [L55-L72] ~n := #in~n; [L55-L72] ~m := #in~m; [L56] COND FALSE !(~n <= 1) [L59] COND FALSE !(2 == ~n) [L62] COND TRUE ~n > 2 [L63] COND FALSE !(~m <= 1) [L66] CALL call #t~ret6 := multiple_of(~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [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) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == ~m); [?] assume !(0 == ~n); [?] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume ~n < 0; [?] CALL call #t~ret3 := multiple_of(-~n, ~m); [?] ~n := #in~n;~m := #in~m; [?] assume !(~m < 0); [?] assume !(~n < 0); [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L36-L38] assume !(0 == ~m); [L39-L41] assume !(0 == ~n); [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume ~n < 0; [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30-L32] assume !(~m < 0); [L33-L35] assume !(~n < 0); [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND FALSE !(~n < 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L36] COND FALSE !(0 == ~m) [L39] COND FALSE !(0 == ~n) [L42] CALL call #t~ret4 := multiple_of(~n - ~m, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~m; [L30] COND FALSE !(~m < 0) [L33] COND TRUE ~n < 0 [L34] CALL call #t~ret3 := multiple_of(-~n, ~m); [L29-L43] ~n := #in~n; [L29-L43] ~m := #in~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) ----- 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...