./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4130d48586bacb8e01e8525ec6ffcd9f272030d26882b368d1c87de47eeb037 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:21:05,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:21:05,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:21:05,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:21:05,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:21:05,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:21:05,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:21:05,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:21:05,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:21:05,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:21:05,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:21:05,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:21:05,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:21:05,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:21:05,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:21:05,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:21:05,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:21:05,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:21:05,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:21:05,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:21:05,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:21:05,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:21:05,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:21:05,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:21:05,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:21:05,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:21:05,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:21:05,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:21:05,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:21:05,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:21:05,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:21:05,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:21:05,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:21:05,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:21:05,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:21:05,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:21:05,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:21:05,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:21:05,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:21:05,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:21:05,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:21:05,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:21:05,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:21:05,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:21:05,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:21:05,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:21:05,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:21:05,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:21:05,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:21:05,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:21:05,470 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:21:05,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:21:05,471 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:21:05,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:21:05,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:21:05,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:21:05,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:21:05,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:21:05,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:21:05,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:21:05,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:21:05,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:21:05,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:21:05,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:21:05,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:21:05,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:21:05,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:21:05,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:21:05,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:21:05,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:21:05,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:21:05,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:21:05,477 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:21:05,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:21:05,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:21:05,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN 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(G ! call(reach_error())) ) 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 -> a4130d48586bacb8e01e8525ec6ffcd9f272030d26882b368d1c87de47eeb037 [2022-11-20 12:21:05,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:21:05,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:21:05,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:21:05,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:21:05,805 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:21:05,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_3+newton_2_2.i [2022-11-20 12:21:09,000 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:21:09,227 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:21:09,228 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i [2022-11-20 12:21:09,236 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data/7024e981e/9f0afc5a6c9d4a2f890e70f5b5973d9b/FLAG62d199f31 [2022-11-20 12:21:09,259 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data/7024e981e/9f0afc5a6c9d4a2f890e70f5b5973d9b [2022-11-20 12:21:09,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:21:09,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:21:09,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:21:09,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:21:09,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:21:09,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d431b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09, skipping insertion in model container [2022-11-20 12:21:09,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:21:09,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:21:09,555 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[1226,1239] [2022-11-20 12:21:09,588 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[2841,2854] [2022-11-20 12:21:09,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:21:09,600 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:21:09,613 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[1226,1239] [2022-11-20 12:21:09,625 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[2841,2854] [2022-11-20 12:21:09,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:21:09,641 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:21:09,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09 WrapperNode [2022-11-20 12:21:09,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:21:09,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:21:09,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:21:09,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:21:09,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,686 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-20 12:21:09,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:21:09,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:21:09,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:21:09,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:21:09,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:21:09,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:21:09,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:21:09,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:21:09,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (1/1) ... [2022-11-20 12:21:09,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:21:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:09,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:21:09,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:21:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:21:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 12:21:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 12:21:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 12:21:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 12:21:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:21:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:21:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:21:09,893 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:21:09,896 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:21:10,149 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:21:10,155 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:21:10,156 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:21:10,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:10 BoogieIcfgContainer [2022-11-20 12:21:10,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:21:10,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:21:10,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:21:10,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:21:10,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:21:09" (1/3) ... [2022-11-20 12:21:10,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8a239a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:10, skipping insertion in model container [2022-11-20 12:21:10,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:21:09" (2/3) ... [2022-11-20 12:21:10,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8a239a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:21:10, skipping insertion in model container [2022-11-20 12:21:10,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:21:10" (3/3) ... [2022-11-20 12:21:10,192 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_2.i [2022-11-20 12:21:10,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:21:10,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:21:10,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:21:10,329 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45e40267, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:21:10,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 12:21:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:21:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:21:10,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:10,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:10,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:21:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:10,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 12:21:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:10,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187024019] [2022-11-20 12:21:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:10,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187024019] [2022-11-20 12:21:10,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187024019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:10,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:10,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:21:10,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956039515] [2022-11-20 12:21:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:10,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:21:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:21:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:21:10,828 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:10,899 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-11-20 12:21:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:21:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:21:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:10,915 INFO L225 Difference]: With dead ends: 90 [2022-11-20 12:21:10,916 INFO L226 Difference]: Without dead ends: 36 [2022-11-20 12:21:10,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:21:10,930 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:10,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:21:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-20 12:21:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-20 12:21:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:21:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-20 12:21:10,977 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-20 12:21:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:10,978 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-20 12:21:10,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-20 12:21:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:21:10,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:10,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:10,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:21:10,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:21:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-11-20 12:21:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:10,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224513434] [2022-11-20 12:21:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224513434] [2022-11-20 12:21:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224513434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:21:11,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:21:11,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:21:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359332347] [2022-11-20 12:21:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:21:11,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:21:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:21:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:21:11,244 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:11,324 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-20 12:21:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:21:11,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:21:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:11,340 INFO L225 Difference]: With dead ends: 36 [2022-11-20 12:21:11,340 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 12:21:11,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:21:11,342 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:11,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:21:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 12:21:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 12:21:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:21:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 12:21:11,350 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 12:21:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:11,350 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 12:21:11,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 12:21:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:21:11,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:11,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:11,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:21:11,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:21:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-20 12:21:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:11,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799331701] [2022-11-20 12:21:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:11,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:21:11,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559805293] [2022-11-20 12:21:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:11,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:11,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:21:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:21:11,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 12:21:11,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:21:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:12,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:21:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:21:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:21:31,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799331701] [2022-11-20 12:21:31,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:21:31,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559805293] [2022-11-20 12:21:31,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559805293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:21:31,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:21:31,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-20 12:21:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004772694] [2022-11-20 12:21:31,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:21:31,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 12:21:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:21:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 12:21:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=184, Unknown=8, NotChecked=0, Total=240 [2022-11-20 12:21:31,324 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:21:39,532 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-20 12:21:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:21:39,534 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 12:21:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:21:39,535 INFO L225 Difference]: With dead ends: 42 [2022-11-20 12:21:39,535 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 12:21:39,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=96, Invalid=313, Unknown=11, NotChecked=0, Total=420 [2022-11-20 12:21:39,538 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:21:39,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 255 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 9 Unchecked, 0.5s Time] [2022-11-20 12:21:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 12:21:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 12:21:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:21:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 12:21:39,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-20 12:21:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:21:39,547 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 12:21:39,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:21:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 12:21:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:21:39,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:21:39,549 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:21:39,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 12:21:39,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:39,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:21:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:21:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-11-20 12:21:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:21:39,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620059115] [2022-11-20 12:21:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:21:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:21:39,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:21:39,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87738756] [2022-11-20 12:21:39,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:21:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:21:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:21:39,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:21:39,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:21:39,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:21:39,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:21:39,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 12:21:39,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:22:25,858 WARN L233 SmtUtils]: Spent 19.27s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:22:45,022 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse5 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5))) (let ((.cse8 (mod .cse7 256))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse8))) (and (not (= 0 .cse5)) (= .cse4 (mod (+ .cse6 (* 255 .cse7)) 256)) (not (= .cse8 0)) (not (<= (mod (+ .cse6 .cse7) 256) 127)) (<= .cse5 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse9 0) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256))))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10))) (let ((.cse13 (mod .cse12 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (not (= 0 .cse10)) (= .cse4 (mod (+ .cse11 (* 255 .cse12)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse11 .cse12) 256) 127) (<= .cse10 127) (not (= .cse11 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse14 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256))))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse16)))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (not (= .cse15 0)) (not (<= .cse16 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse16) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse19 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse21 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse19))) (let ((.cse22 (mod .cse21 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse22))) (and (not (= 0 .cse19)) (= .cse4 (mod (+ .cse20 (* 255 .cse21)) 256)) (not (= .cse22 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= (mod (+ .cse20 .cse21) 256) 127) (<= .cse19 127) (not (= .cse20 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse24)))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (not (= .cse23 0)) (not (<= .cse24 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse24) (<= (mod (+ .cse25 .cse26) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse27 0) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 256))))) (not (= .cse25 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse30 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28))) (let ((.cse31 (mod .cse30 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse31))) (and (not (= 0 .cse28)) (= .cse4 (mod (+ .cse29 (* 255 .cse30)) 256)) (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (<= (mod (+ .cse29 .cse30) 256) 127)) (<= .cse28 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse33 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse33)))) (let ((.cse32 (mod .cse35 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= .cse32 0)) (not (<= .cse33 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse33) (not (<= (mod (+ .cse34 .cse35) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse36 0) (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 256))))) (= .cse4 (mod (+ .cse34 (* 255 .cse35)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse37 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse38 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse37) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse38) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= .cse37 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse39 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse40 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse39) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse39) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse40 0)) (<= .cse39 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse41 0) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256))))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 12:22:52,064 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse0))) (let ((.cse4 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse4))) (and (not (= 0 .cse0)) (= .cse1 (mod (+ .cse2 (* 255 .cse3)) 256)) (not (= .cse4 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (<= .cse0 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse6)))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (not (= .cse5 0)) (not (<= .cse6 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse6) (<= (mod (+ .cse7 .cse8) 256) 127) (not (= .cse7 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse7 (* 255 .cse8)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse9 0)) (<= .cse10 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse11) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse12) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse12 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse12 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= .cse11 127))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse16 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse14))) (let ((.cse13 (mod .cse16 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse14)) (= .cse1 (mod (+ .cse15 (* 255 .cse16)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse15 .cse16) 256) 127) (<= .cse14 127) (not (= .cse15 0)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse20 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18))) (let ((.cse17 (mod .cse20 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse17))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse18)) (= .cse1 (mod (+ .cse19 (* 255 .cse20)) 256)) (not (= .cse17 0)) (not (<= (mod (+ .cse19 .cse20) 256) 127)) (<= .cse18 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse22 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse22)))) (let ((.cse21 (mod .cse24 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse21))) (and (not (= .cse21 0)) (not (<= .cse22 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse22) (<= (mod (+ .cse23 .cse24) 256) 127) (not (= .cse23 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse23 (* 255 .cse24)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse26)))) (let ((.cse25 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse25))) (and (not (= .cse25 0)) (not (<= .cse26 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse26) (not (<= (mod (+ .cse27 .cse28) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse27 (* 255 .cse28)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse29 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse31 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse29))) (let ((.cse32 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= 0 .cse29)) (= .cse1 (mod (+ .cse30 (* 255 .cse31)) 256)) (not (= .cse32 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= (mod (+ .cse30 .cse31) 256) 127) (<= .cse29 127) (not (= .cse30 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse34)))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (not (= .cse33 0)) (not (<= .cse34 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse34) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse35 (* 255 .cse36)) 256)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 12:22:59,479 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (let ((.cse4 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse6)) (not (= .cse5 0)) (= .cse4 (mod (+ .cse7 (* 255 .cse8)) 256)) (<= (mod (+ .cse7 .cse8) 256) 127) (<= .cse6 127) (not (= .cse7 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (not (= .cse9 0)) (<= .cse10 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse12 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse14 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse12)))) (let ((.cse11 (mod .cse14 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11))) (and (not (= .cse11 0)) (not (<= .cse12 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse12) (<= (mod (+ .cse13 .cse14) 256) 127) (not (= .cse13 0)) (= .cse4 (mod (+ .cse13 (* 255 .cse14)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse16))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse16)) (not (= .cse15 0)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (<= .cse16 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse20)))) (let ((.cse19 (mod .cse22 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (and (not (= .cse19 0)) (not (<= .cse20 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse20) (not (<= (mod (+ .cse21 .cse22) 256) 127)) (= .cse4 (mod (+ .cse21 (* 255 .cse22)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse24))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse24)) (not (= .cse23 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)) (<= (mod (+ .cse25 .cse26) 256) 127) (<= .cse24 127) (not (= .cse25 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse27 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse28) (not (= .cse27 0)) (<= .cse28 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse27) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse31 (* 255 .cse32)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse34))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse34)) (not (= .cse33 0)) (= .cse4 (mod (+ .cse35 (* 255 .cse36)) 256)) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (<= .cse34 127)))))))))))) is different from false [2022-11-20 12:23:09,304 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1))) (let ((.cse0 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (let ((.cse2 (mod (+ .cse3 (* 255 .cse4)) 256))) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse1)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse2)) 256) 0) (not (= .cse0 0)) (not (<= (mod (+ .cse3 .cse4) 256) 127)) (<= .cse1 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse2)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse7) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse6) 256))) (and (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse7) (not (= .cse8 0)) (not (= .cse6 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse8) (<= .cse7 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse8) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse11)))) (let ((.cse9 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9))) (let ((.cse10 (mod (+ .cse12 (* 255 .cse13)) 256))) (and (not (= .cse9 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse10)) 256) 0) (not (<= .cse11 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse11) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse12 .cse13) 256) 127)) (<= .cse5 .cse10)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse17 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse15)))) (let ((.cse14 (mod .cse17 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse14))) (let ((.cse18 (mod (+ .cse16 (* 255 .cse17)) 256))) (and (not (= .cse14 0)) (not (<= .cse15 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse15) (<= (mod (+ .cse16 .cse17) 256) 127) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse16 0)) (<= .cse5 .cse18) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse18)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse21 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse21)))) (let ((.cse19 (mod .cse23 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (let ((.cse20 (mod (+ .cse22 (* 255 .cse23)) 256))) (and (not (= .cse19 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse20)) 256) 0) (not (<= .cse21 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse21) (<= (mod (+ .cse22 .cse23) 256) 127) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse22 0)) (<= .cse5 .cse20)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse25))) (let ((.cse24 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse24))) (let ((.cse26 (mod (+ .cse27 (* 255 .cse28)) 256))) (and (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse25)) (not (= .cse24 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse26)) 0) (<= (mod (+ .cse27 .cse28) 256) 127) (<= .cse25 127) (not (= .cse27 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse26)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (let ((.cse33 (mod (+ .cse31 (* 255 .cse32)) 256))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (<= .cse5 .cse33) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse33)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse34 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse34) 256))) (and (<= .cse34 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse35) (not (= .cse36 0)) (not (= .cse34 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse36) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (<= .cse35 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse41 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse38))) (let ((.cse37 (mod .cse41 256))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse41)) 256))) (and (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse38)) (not (= .cse37 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse39)) 0) (not (<= (mod (+ .cse40 .cse41) 256) 127)) (<= .cse38 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse39)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse46 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse43))) (let ((.cse42 (mod .cse46 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse42))) (let ((.cse44 (mod (+ .cse45 (* 255 .cse46)) 256))) (and (<= .cse42 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse43)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse44)) 256) 0) (not (= .cse42 0)) (<= (mod (+ .cse45 .cse46) 256) 127) (<= .cse43 127) (not (= .cse45 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse44)))))))))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 12:23:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 12:23:21,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:25:37,219 WARN L233 SmtUtils]: Spent 1.86m on a formula simplification. DAG size of input: 92 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:26:01,587 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse24 (mod (+ .cse22 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse14 (mod .cse22 256)) (.cse3 (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (.cse7 (<= .cse24 127)) (.cse18 (= .cse24 0)) (.cse10 (not .cse11)) (.cse19 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| .cse24) 256))) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_17|) (< |v_ULTIMATE.start_gcd_test_~a#1_16| .cse24) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse25) 256) 0)) (< .cse25 .cse13) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0)))))) (let ((.cse5 (or .cse18 .cse10 .cse19)) (.cse6 (not .cse7)) (.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse2 (not .cse3)) (.cse9 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| (+ (- 256) .cse24)) 256))) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_17|) (< .cse23 .cse13) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse24) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse23) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0))))) (.cse15 (<= .cse14 127))) (and (or (let ((.cse4 (or .cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| (+ (- 256) .cse14)) 256))) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_17|) (< .cse12 .cse13) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_16|) .cse14) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse12) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0))))))) (and (or (let ((.cse0 (and .cse4 .cse5))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3))) .cse6) (or .cse7 (let ((.cse8 (and .cse4 (or .cse9 .cse10)))) (and (or .cse8 .cse1 .cse3) (or .cse8 .cse1 .cse2)))))) .cse15) (or (let ((.cse17 (= .cse22 0)) (.cse16 (or .cse11 (= .cse14 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_17| Int) (|v_ULTIMATE.start_gcd_test_~a#1_16| Int)) (let ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_17| .cse14) 256))) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_17|) (< .cse21 .cse13) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_16| .cse21) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_17| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_16| .cse14))))))) (and (or (and (or (and .cse5 .cse16) .cse1 .cse2) (or .cse1 .cse3 (and (or .cse17 .cse18 .cse10 .cse19) .cse16))) .cse6) (or .cse7 (let ((.cse20 (and (or .cse17 .cse9 .cse10) .cse16))) (and (or .cse20 .cse1 .cse3) (or .cse20 .cse1 .cse2)))))) (not .cse15)))))))) is different from false [2022-11-20 12:27:34,583 WARN L233 SmtUtils]: Spent 49.48s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:28:00,017 WARN L233 SmtUtils]: Spent 11.75s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:28:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 12:28:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:28:00,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620059115] [2022-11-20 12:28:00,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:28:00,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87738756] [2022-11-20 12:28:00,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87738756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:28:00,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:28:00,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-11-20 12:28:00,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982965488] [2022-11-20 12:28:00,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:28:00,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 12:28:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:28:00,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 12:28:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=192, Unknown=30, NotChecked=170, Total=462 [2022-11-20 12:28:00,362 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:28:18,562 WARN L233 SmtUtils]: Spent 10.58s on a formula simplification. DAG size of input: 127 DAG size of output: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:29:37,649 WARN L233 SmtUtils]: Spent 52.04s on a formula simplification. DAG size of input: 91 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:29:39,668 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse42 (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|))) (.cse43 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse5 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5))) (let ((.cse8 (mod .cse7 256))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse8))) (and (not (= 0 .cse5)) (= .cse4 (mod (+ .cse6 (* 255 .cse7)) 256)) (not (= .cse8 0)) (not (<= (mod (+ .cse6 .cse7) 256) 127)) (<= .cse5 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse9 0) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256))))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10))) (let ((.cse13 (mod .cse12 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (not (= 0 .cse10)) (= .cse4 (mod (+ .cse11 (* 255 .cse12)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse11 .cse12) 256) 127) (<= .cse10 127) (not (= .cse11 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse14 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256))))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse16)))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (not (= .cse15 0)) (not (<= .cse16 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse16) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse19 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse21 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse19))) (let ((.cse22 (mod .cse21 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse22))) (and (not (= 0 .cse19)) (= .cse4 (mod (+ .cse20 (* 255 .cse21)) 256)) (not (= .cse22 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= (mod (+ .cse20 .cse21) 256) 127) (<= .cse19 127) (not (= .cse20 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse24)))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (not (= .cse23 0)) (not (<= .cse24 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse24) (<= (mod (+ .cse25 .cse26) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse27 0) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 256))))) (not (= .cse25 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse30 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28))) (let ((.cse31 (mod .cse30 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse31))) (and (not (= 0 .cse28)) (= .cse4 (mod (+ .cse29 (* 255 .cse30)) 256)) (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (not (<= (mod (+ .cse29 .cse30) 256) 127)) (<= .cse28 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse33 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse33)))) (let ((.cse32 (mod .cse35 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= .cse32 0)) (not (<= .cse33 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse33) (not (<= (mod (+ .cse34 .cse35) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse36 0) (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 256))))) (= .cse4 (mod (+ .cse34 (* 255 .cse35)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse37 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse38 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse37) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse38) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) (<= .cse37 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse39 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse40 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse39) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse39) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse40 0)) (<= .cse39 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse41 0) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256))))))))))))) (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) .cse42 (< |c_ULTIMATE.start_gcd_test_~a#1| .cse43)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or .cse42 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse43)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0)))) is different from false [2022-11-20 12:29:41,696 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse0))) (let ((.cse4 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse4))) (and (not (= 0 .cse0)) (= .cse1 (mod (+ .cse2 (* 255 .cse3)) 256)) (not (= .cse4 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (<= .cse0 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse6)))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (not (= .cse5 0)) (not (<= .cse6 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse6) (<= (mod (+ .cse7 .cse8) 256) 127) (not (= .cse7 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse7 (* 255 .cse8)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse9 0)) (<= .cse10 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse11) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse12) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse12 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse12 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= .cse11 127))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse16 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse14))) (let ((.cse13 (mod .cse16 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse14)) (= .cse1 (mod (+ .cse15 (* 255 .cse16)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse15 .cse16) 256) 127) (<= .cse14 127) (not (= .cse15 0)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse20 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18))) (let ((.cse17 (mod .cse20 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse17))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse18)) (= .cse1 (mod (+ .cse19 (* 255 .cse20)) 256)) (not (= .cse17 0)) (not (<= (mod (+ .cse19 .cse20) 256) 127)) (<= .cse18 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse22 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse22)))) (let ((.cse21 (mod .cse24 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse21))) (and (not (= .cse21 0)) (not (<= .cse22 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse22) (<= (mod (+ .cse23 .cse24) 256) 127) (not (= .cse23 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse23 (* 255 .cse24)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse26)))) (let ((.cse25 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse25))) (and (not (= .cse25 0)) (not (<= .cse26 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse26) (not (<= (mod (+ .cse27 .cse28) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse27 (* 255 .cse28)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse29 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse31 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse29))) (let ((.cse32 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= 0 .cse29)) (= .cse1 (mod (+ .cse30 (* 255 .cse31)) 256)) (not (= .cse32 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= (mod (+ .cse30 .cse31) 256) 127) (<= .cse29 127) (not (= .cse30 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse34)))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (not (= .cse33 0)) (not (<= .cse34 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse34) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse35 (* 255 .cse36)) 256)))))))))) (or (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (< |c_ULTIMATE.start_gcd_test_~a#1| (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 12:29:43,733 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (< |c_ULTIMATE.start_gcd_test_#res#1| (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (not (<= |c_ULTIMATE.start_gcd_test_#res#1| 127))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (let ((.cse4 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse6)) (not (= .cse5 0)) (= .cse4 (mod (+ .cse7 (* 255 .cse8)) 256)) (<= (mod (+ .cse7 .cse8) 256) 127) (<= .cse6 127) (not (= .cse7 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (not (= .cse9 0)) (<= .cse10 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse12 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse14 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse12)))) (let ((.cse11 (mod .cse14 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11))) (and (not (= .cse11 0)) (not (<= .cse12 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse12) (<= (mod (+ .cse13 .cse14) 256) 127) (not (= .cse13 0)) (= .cse4 (mod (+ .cse13 (* 255 .cse14)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse16))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse16)) (not (= .cse15 0)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (<= .cse16 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse20)))) (let ((.cse19 (mod .cse22 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (and (not (= .cse19 0)) (not (<= .cse20 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse20) (not (<= (mod (+ .cse21 .cse22) 256) 127)) (= .cse4 (mod (+ .cse21 (* 255 .cse22)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse24))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse24)) (not (= .cse23 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)) (<= (mod (+ .cse25 .cse26) 256) 127) (<= .cse24 127) (not (= .cse25 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse27 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse28) (not (= .cse27 0)) (<= .cse28 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse27) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse31 (* 255 .cse32)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse34))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse34)) (not (= .cse33 0)) (= .cse4 (mod (+ .cse35 (* 255 .cse36)) 256)) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (<= .cse34 127)))))))))))) is different from false [2022-11-20 12:29:45,769 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1))) (let ((.cse0 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (let ((.cse2 (mod (+ .cse3 (* 255 .cse4)) 256))) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse1)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse2)) 256) 0) (not (= .cse0 0)) (not (<= (mod (+ .cse3 .cse4) 256) 127)) (<= .cse1 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse2)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse7) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse6) 256))) (and (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse7) (not (= .cse8 0)) (not (= .cse6 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse8) (<= .cse7 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse8) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse11)))) (let ((.cse9 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9))) (let ((.cse10 (mod (+ .cse12 (* 255 .cse13)) 256))) (and (not (= .cse9 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse10)) 256) 0) (not (<= .cse11 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse11) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse12 .cse13) 256) 127)) (<= .cse5 .cse10)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse17 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse15)))) (let ((.cse14 (mod .cse17 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse14))) (let ((.cse18 (mod (+ .cse16 (* 255 .cse17)) 256))) (and (not (= .cse14 0)) (not (<= .cse15 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse15) (<= (mod (+ .cse16 .cse17) 256) 127) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse16 0)) (<= .cse5 .cse18) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse18)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse21 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse21)))) (let ((.cse19 (mod .cse23 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (let ((.cse20 (mod (+ .cse22 (* 255 .cse23)) 256))) (and (not (= .cse19 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse20)) 256) 0) (not (<= .cse21 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse21) (<= (mod (+ .cse22 .cse23) 256) 127) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse22 0)) (<= .cse5 .cse20)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse25))) (let ((.cse24 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse24))) (let ((.cse26 (mod (+ .cse27 (* 255 .cse28)) 256))) (and (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse25)) (not (= .cse24 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse26)) 0) (<= (mod (+ .cse27 .cse28) 256) 127) (<= .cse25 127) (not (= .cse27 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse26)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (let ((.cse33 (mod (+ .cse31 (* 255 .cse32)) 256))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (<= .cse5 .cse33) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse33)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse34 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse34) 256))) (and (<= .cse34 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse35) (not (= .cse36 0)) (not (= .cse34 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse36) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (<= .cse35 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse41 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse38))) (let ((.cse37 (mod .cse41 256))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse41)) 256))) (and (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse38)) (not (= .cse37 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse39)) 0) (not (<= (mod (+ .cse40 .cse41) 256) 127)) (<= .cse38 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse39)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse46 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse43))) (let ((.cse42 (mod .cse46 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse42))) (let ((.cse44 (mod (+ .cse45 (* 255 .cse46)) 256))) (and (<= .cse42 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse43)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse44)) 256) 0) (not (= .cse42 0)) (<= (mod (+ .cse45 .cse46) 256) 127) (<= .cse43 127) (not (= .cse45 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse44)))))))))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 12:29:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:29:45,787 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-11-20 12:29:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 12:29:45,788 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:29:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:29:45,789 INFO L225 Difference]: With dead ends: 47 [2022-11-20 12:29:45,789 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 12:29:45,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 378.8s TimeCoverageRelationStatistics Valid=106, Invalid=265, Unknown=45, NotChecked=396, Total=812 [2022-11-20 12:29:45,790 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:29:45,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 354 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-11-20 12:29:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 12:29:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-20 12:29:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:29:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-20 12:29:45,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 14 [2022-11-20 12:29:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:29:45,805 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-20 12:29:45,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:29:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-20 12:29:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:29:45,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:29:45,806 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:29:45,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 12:29:46,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:29:46,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:29:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:29:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1911673028, now seen corresponding path program 1 times [2022-11-20 12:29:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:29:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954445909] [2022-11-20 12:29:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:29:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:29:46,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 12:29:46,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249074503] [2022-11-20 12:29:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:29:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:29:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:29:46,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:29:46,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:29:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:29:46,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 12:29:46,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:29:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:29:55,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954445909] [2022-11-20 12:29:55,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 12:29:55,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249074503] [2022-11-20 12:29:55,472 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-20 12:29:55,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-20 12:29:55,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:29:55,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:29:55,674 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 51 more [2022-11-20 12:29:55,677 INFO L158 Benchmark]: Toolchain (without parser) took 526409.54ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 133.7MB in the beginning and 155.9MB in the end (delta: -22.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-11-20 12:29:55,677 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 119.5MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:29:55,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.15ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 132.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:29:55,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 130.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:29:55,679 INFO L158 Benchmark]: Boogie Preprocessor took 30.69ms. Allocated memory is still 169.9MB. Free memory was 130.7MB in the beginning and 129.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:29:55,679 INFO L158 Benchmark]: RCFGBuilder took 439.57ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 117.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 12:29:55,679 INFO L158 Benchmark]: TraceAbstraction took 525515.53ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 116.2MB in the beginning and 155.9MB in the end (delta: -39.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:29:55,681 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 119.5MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.15ms. Allocated memory is still 169.9MB. Free memory was 133.7MB in the beginning and 132.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 130.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.69ms. Allocated memory is still 169.9MB. Free memory was 130.7MB in the beginning and 129.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 439.57ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 117.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 525515.53ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 116.2MB in the beginning and 155.9MB in the end (delta: -39.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4130d48586bacb8e01e8525ec6ffcd9f272030d26882b368d1c87de47eeb037 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:29:57,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:29:57,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:29:57,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:29:57,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:29:57,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:29:57,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:29:57,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:29:57,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:29:57,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:29:57,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:29:57,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:29:57,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:29:57,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:29:57,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:29:57,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:29:57,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:29:57,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:29:57,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:29:57,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:29:57,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:29:57,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:29:57,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:29:57,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:29:57,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:29:57,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:29:57,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:29:57,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:29:57,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:29:57,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:29:57,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:29:57,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:29:57,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:29:57,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:29:57,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:29:57,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:29:57,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:29:57,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:29:57,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:29:57,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:29:57,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:29:57,995 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 12:29:58,020 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:29:58,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:29:58,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:29:58,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:29:58,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:29:58,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:29:58,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:29:58,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:29:58,024 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:29:58,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:29:58,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:29:58,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:29:58,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:29:58,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:29:58,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:29:58,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:29:58,026 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:29:58,026 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 12:29:58,027 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 12:29:58,027 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:29:58,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:29:58,028 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:29:58,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:29:58,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:29:58,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:29:58,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:29:58,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:29:58,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:29:58,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:29:58,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:29:58,030 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 12:29:58,031 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 12:29:58,031 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:29:58,031 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:29:58,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:29:58,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 12:29:58,032 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN 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(G ! call(reach_error())) ) 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 -> a4130d48586bacb8e01e8525ec6ffcd9f272030d26882b368d1c87de47eeb037 [2022-11-20 12:29:58,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:29:58,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:29:58,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:29:58,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:29:58,397 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:29:58,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_3+newton_2_2.i [2022-11-20 12:30:01,526 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:30:01,772 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:30:01,773 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i [2022-11-20 12:30:01,790 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data/13ec7410f/3046e8fe67cb4c00881dba83eb11187c/FLAG1d64cc7c9 [2022-11-20 12:30:01,814 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/data/13ec7410f/3046e8fe67cb4c00881dba83eb11187c [2022-11-20 12:30:01,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:30:01,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:30:01,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:30:01,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:30:01,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:30:01,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:30:01" (1/1) ... [2022-11-20 12:30:01,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9fb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:01, skipping insertion in model container [2022-11-20 12:30:01,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:30:01" (1/1) ... [2022-11-20 12:30:01,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:30:01,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:30:02,017 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[1226,1239] [2022-11-20 12:30:02,043 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[2841,2854] [2022-11-20 12:30:02,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:30:02,058 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:30:02,079 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[1226,1239] [2022-11-20 12:30:02,090 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/sv-benchmarks/c/combinations/gcd_3+newton_2_2.i[2841,2854] [2022-11-20 12:30:02,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:30:02,110 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:30:02,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02 WrapperNode [2022-11-20 12:30:02,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:30:02,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:30:02,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:30:02,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:30:02,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,171 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-20 12:30:02,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:30:02,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:30:02,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:30:02,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:30:02,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:30:02,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:30:02,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:30:02,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:30:02,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (1/1) ... [2022-11-20 12:30:02,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:30:02,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:30:02,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:30:02,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:30:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:30:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 12:30:02,356 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 12:30:02,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 12:30:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 12:30:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 12:30:02,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:30:02,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:30:02,488 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:30:02,490 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:30:11,671 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:30:11,678 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:30:11,679 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:30:11,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:30:11 BoogieIcfgContainer [2022-11-20 12:30:11,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:30:11,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:30:11,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:30:11,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:30:11,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:30:01" (1/3) ... [2022-11-20 12:30:11,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f1d597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:30:11, skipping insertion in model container [2022-11-20 12:30:11,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:30:02" (2/3) ... [2022-11-20 12:30:11,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f1d597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:30:11, skipping insertion in model container [2022-11-20 12:30:11,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:30:11" (3/3) ... [2022-11-20 12:30:11,691 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_2.i [2022-11-20 12:30:11,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:30:11,710 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:30:11,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:30:11,769 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ce29664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:30:11,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 12:30:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:30:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:30:11,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:30:11,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:30:11,787 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:30:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 12:30:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:30:11,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504866280] [2022-11-20 12:30:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:11,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:11,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:30:11,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:30:11,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 12:30:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:11,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:30:11,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:30:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:12,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:30:12,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:30:12,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504866280] [2022-11-20 12:30:12,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504866280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:12,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:12,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:30:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738478837] [2022-11-20 12:30:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:12,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:30:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:30:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:30:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:30:12,098 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:30:12,152 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-20 12:30:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:30:12,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:30:12,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:30:12,163 INFO L225 Difference]: With dead ends: 68 [2022-11-20 12:30:12,164 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 12:30:12,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:30:12,177 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:30:12,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-20 12:30:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 12:30:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 12:30:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:30:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 12:30:12,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-20 12:30:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:30:12,227 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 12:30:12,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 12:30:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:30:12,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:30:12,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:30:12,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:30:12,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:12,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:30:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-20 12:30:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:30:12,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230561797] [2022-11-20 12:30:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:12,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:12,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:30:12,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:30:12,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 12:30:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:12,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:30:12,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:30:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:12,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:30:12,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:30:12,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230561797] [2022-11-20 12:30:12,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230561797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:12,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:12,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:30:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815758492] [2022-11-20 12:30:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:30:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:30:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:30:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:30:12,678 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:30:12,838 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-20 12:30:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:30:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:30:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:30:12,841 INFO L225 Difference]: With dead ends: 46 [2022-11-20 12:30:12,841 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 12:30:12,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:30:12,843 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:30:12,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:30:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 12:30:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-11-20 12:30:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:30:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 12:30:12,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 12:30:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:30:12,851 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 12:30:12,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 12:30:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 12:30:12,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:30:12,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:30:12,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:30:13,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:13,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:30:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash -743724587, now seen corresponding path program 1 times [2022-11-20 12:30:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:30:13,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368678275] [2022-11-20 12:30:13,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:13,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:30:13,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:30:13,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 12:30:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:13,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:30:13,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:30:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:13,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:30:13,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:30:13,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368678275] [2022-11-20 12:30:13,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368678275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:13,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:13,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:30:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580758868] [2022-11-20 12:30:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:30:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:30:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:30:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:30:13,695 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:30:14,449 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-20 12:30:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:30:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 12:30:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:30:14,451 INFO L225 Difference]: With dead ends: 37 [2022-11-20 12:30:14,452 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 12:30:14,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:30:14,454 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:30:14,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:30:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 12:30:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-20 12:30:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:30:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 12:30:14,461 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 12:30:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:30:14,461 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 12:30:14,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 12:30:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:30:14,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:30:14,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:30:14,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:30:14,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:14,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:30:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-20 12:30:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:30:14,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14385942] [2022-11-20 12:30:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:30:14,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:30:14,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 12:30:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:14,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:30:14,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:30:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:17,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:30:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:35,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:30:35,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14385942] [2022-11-20 12:30:35,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14385942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:30:35,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:30:35,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-20 12:30:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553601098] [2022-11-20 12:30:35,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:30:35,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:30:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:30:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:30:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=238, Unknown=5, NotChecked=0, Total=306 [2022-11-20 12:30:35,132 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:30:35,199 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-20 12:30:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:30:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 12:30:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:30:35,201 INFO L225 Difference]: With dead ends: 43 [2022-11-20 12:30:35,201 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 12:30:35,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=63, Invalid=238, Unknown=5, NotChecked=0, Total=306 [2022-11-20 12:30:35,202 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:30:35,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 268 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-11-20 12:30:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 12:30:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-20 12:30:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:30:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 12:30:35,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-20 12:30:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:30:35,210 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 12:30:35,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 12:30:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:30:35,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:30:35,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:30:35,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:30:35,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:35,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:30:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 20667420, now seen corresponding path program 1 times [2022-11-20 12:30:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:30:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045924369] [2022-11-20 12:30:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:35,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:35,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:30:35,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:30:35,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 12:30:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:35,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 12:30:35,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:30:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:40,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:30:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:30:49,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:30:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045924369] [2022-11-20 12:30:49,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045924369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:30:49,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:30:49,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-20 12:30:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641460854] [2022-11-20 12:30:49,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:30:49,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:30:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:30:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:30:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:30:49,739 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:30:59,009 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-20 12:30:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:30:59,010 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 12:30:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:30:59,011 INFO L225 Difference]: With dead ends: 45 [2022-11-20 12:30:59,011 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 12:30:59,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:30:59,013 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:30:59,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 199 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 9 Unchecked, 1.5s Time] [2022-11-20 12:30:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 12:30:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-11-20 12:30:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:30:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 12:30:59,020 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-20 12:30:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:30:59,021 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 12:30:59,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:30:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 12:30:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:30:59,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:30:59,022 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:30:59,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-20 12:30:59,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:59,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:30:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-11-20 12:30:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:30:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614612627] [2022-11-20 12:30:59,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:30:59,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:30:59,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:30:59,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:30:59,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 12:31:04,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:31:04,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:31:04,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 12:31:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:31:33,038 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 12:31:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:31:35,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:33:18,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 12:33:18,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614612627] [2022-11-20 12:33:18,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614612627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:18,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:33:18,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-11-20 12:33:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085589172] [2022-11-20 12:33:18,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:18,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 12:33:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 12:33:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 12:33:18,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=360, Unknown=27, NotChecked=0, Total=462 [2022-11-20 12:33:18,717 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:33:20,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 12:34:30,678 WARN L233 SmtUtils]: Spent 20.72s on a formula simplification. DAG size of input: 42 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:34:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:34:54,665 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-11-20 12:34:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:34:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 12:34:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:34:54,668 INFO L225 Difference]: With dead ends: 47 [2022-11-20 12:34:54,668 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 12:34:54,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 207.5s TimeCoverageRelationStatistics Valid=147, Invalid=682, Unknown=41, NotChecked=0, Total=870 [2022-11-20 12:34:54,669 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:34:54,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 335 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 26 Unchecked, 2.1s Time] [2022-11-20 12:34:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 12:34:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-20 12:34:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 12:34:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-20 12:34:54,681 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 14 [2022-11-20 12:34:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:34:54,682 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-20 12:34:54,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:34:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-20 12:34:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:34:54,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:34:54,683 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:34:54,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:34:54,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:34:54,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:34:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:34:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1825995883, now seen corresponding path program 2 times [2022-11-20 12:34:54,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 12:34:54,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528668722] [2022-11-20 12:34:54,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:34:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 12:34:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 12:34:54,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 12:34:54,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_724a3af2-6556-4ec8-9feb-aa06897c054d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 12:35:05,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:35:05,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:35:05,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 12:35:05,165 INFO L286 TraceCheckSpWp]: Computing forward predicates...