./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:39:04,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:39:04,714 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:39:04,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:39:04,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:39:04,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:39:04,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:39:04,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:39:04,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:39:04,744 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:39:04,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:39:04,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:39:04,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:39:04,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:39:04,746 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:39:04,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:39:04,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:39:04,748 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:39:04,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:39:04,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:39:04,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:39:04,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:39:04,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:39:04,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:39:04,752 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:39:04,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:39:04,752 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:39:04,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:39:04,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:39:04,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:39:04,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:39:04,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:39:04,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:39:04,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:39:04,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:39:04,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:39:04,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:39:04,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:39:04,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:39:04,756 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:39:04,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:39:04,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:39:04,757 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/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_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2023-11-29 01:39:04,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:39:04,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:39:04,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:39:04,999 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:39:04,999 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:39:05,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2023-11-29 01:39:07,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:39:07,936 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:39:07,936 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2023-11-29 01:39:07,943 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/data/e4639cf0a/d2c29407f24042afaec0c748c579adba/FLAG17ba8f246 [2023-11-29 01:39:07,958 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/data/e4639cf0a/d2c29407f24042afaec0c748c579adba [2023-11-29 01:39:07,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:39:07,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:39:07,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:39:07,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:39:07,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:39:07,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:39:07" (1/1) ... [2023-11-29 01:39:07,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18feb12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:07, skipping insertion in model container [2023-11-29 01:39:07,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:39:07" (1/1) ... [2023-11-29 01:39:07,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:39:08,148 WARN L240 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_9a6f0850-ede2-4323-b164-2883b67a42cc/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2023-11-29 01:39:08,173 WARN L240 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_9a6f0850-ede2-4323-b164-2883b67a42cc/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2023-11-29 01:39:08,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:39:08,186 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:39:08,200 WARN L240 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_9a6f0850-ede2-4323-b164-2883b67a42cc/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2023-11-29 01:39:08,211 WARN L240 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_9a6f0850-ede2-4323-b164-2883b67a42cc/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2023-11-29 01:39:08,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:39:08,228 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:39:08,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08 WrapperNode [2023-11-29 01:39:08,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:39:08,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:39:08,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:39:08,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:39:08,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,269 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-29 01:39:08,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:39:08,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:39:08,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:39:08,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:39:08,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,298 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 01:39:08,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:39:08,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:39:08,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:39:08,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:39:08,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (1/1) ... [2023-11-29 01:39:08,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:39:08,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:39:08,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:39:08,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:39:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:39:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 01:39:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 01:39:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 01:39:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 01:39:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:39:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:39:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:39:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:39:08,440 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:39:08,442 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:39:08,581 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:39:08,602 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:39:08,602 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:39:08,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:39:08 BoogieIcfgContainer [2023-11-29 01:39:08,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:39:08,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:39:08,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:39:08,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:39:08,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:39:07" (1/3) ... [2023-11-29 01:39:08,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb2c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:39:08, skipping insertion in model container [2023-11-29 01:39:08,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:39:08" (2/3) ... [2023-11-29 01:39:08,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb2c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:39:08, skipping insertion in model container [2023-11-29 01:39:08,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:39:08" (3/3) ... [2023-11-29 01:39:08,612 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2023-11-29 01:39:08,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:39:08,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 01:39:08,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:39:08,674 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=LoopHeads, 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;@4eff17aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:39:08,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 01:39:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 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) [2023-11-29 01:39:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:39:08,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:39:08,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:39:08,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:39:08,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:39:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-11-29 01:39:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:39:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151924006] [2023-11-29 01:39:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:39:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:39:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:39:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151924006] [2023-11-29 01:39:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151924006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:39:08,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:39:08,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:39:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533238690] [2023-11-29 01:39:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:39:08,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:39:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:39:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:39:09,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:39:09,004 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 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.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 01:39:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:39:09,095 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-11-29 01:39:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:39:09,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-29 01:39:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:39:09,104 INFO L225 Difference]: With dead ends: 61 [2023-11-29 01:39:09,104 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 01:39:09,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:39:09,111 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:39:09,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:39:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 01:39:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-29 01:39:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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) [2023-11-29 01:39:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-29 01:39:09,149 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2023-11-29 01:39:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:39:09,150 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-29 01:39:09,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 01:39:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-29 01:39:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:39:09,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:39:09,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:39:09,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:39:09,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:39:09,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:39:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-11-29 01:39:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:39:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46726804] [2023-11-29 01:39:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:39:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:39:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:39:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46726804] [2023-11-29 01:39:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46726804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:39:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:39:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:39:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160251673] [2023-11-29 01:39:09,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:39:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:39:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:39:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:39:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:39:09,242 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 01:39:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:39:09,279 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-11-29 01:39:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:39:09,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-29 01:39:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:39:09,280 INFO L225 Difference]: With dead ends: 31 [2023-11-29 01:39:09,280 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 01:39:09,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:39:09,283 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:39:09,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:39:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 01:39:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 01:39:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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) [2023-11-29 01:39:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-29 01:39:09,290 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-11-29 01:39:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:39:09,291 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-29 01:39:09,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-29 01:39:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-29 01:39:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:39:09,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:39:09,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:39:09,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:39:09,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:39:09,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:39:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2023-11-29 01:39:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:39:09,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505091189] [2023-11-29 01:39:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:09,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:39:09,309 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:39:09,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822928778] [2023-11-29 01:39:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:39:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:39:09,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:39:09,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:39:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:39:09,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:39:09,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:39:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:39:09,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:39:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:39:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:39:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505091189] [2023-11-29 01:39:09,509 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:39:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822928778] [2023-11-29 01:39:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822928778] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:39:09,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:39:09,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-29 01:39:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959562208] [2023-11-29 01:39:09,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:39:09,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:39:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:39:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:39:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:39:09,512 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-11-29 01:39:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:39:09,571 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-11-29 01:39:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:39:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 10 [2023-11-29 01:39:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:39:09,573 INFO L225 Difference]: With dead ends: 32 [2023-11-29 01:39:09,573 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 01:39:09,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:39:09,575 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:39:09,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:39:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 01:39:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 01:39:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 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) [2023-11-29 01:39:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-29 01:39:09,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-11-29 01:39:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:39:09,583 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-29 01:39:09,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-11-29 01:39:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-29 01:39:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:39:09,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:39:09,584 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:39:09,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:39:09,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:39:09,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:39:09,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:39:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2023-11-29 01:39:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:39:09,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77435561] [2023-11-29 01:39:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:39:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:39:09,798 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:39:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492671597] [2023-11-29 01:39:09,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:39:09,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:39:09,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:39:09,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:39:09,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:39:09,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:39:09,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:39:09,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 01:39:09,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:39:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:39:34,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:39:51,575 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (< 126 |c_ULTIMATE.start_main1_~y~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-11-29 01:40:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:40:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:40:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77435561] [2023-11-29 01:40:03,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:40:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492671597] [2023-11-29 01:40:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492671597] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:40:03,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:40:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 01:40:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985091947] [2023-11-29 01:40:03,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:40:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:40:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:40:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:40:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=4, NotChecked=22, Total=182 [2023-11-29 01:40:03,318 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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) [2023-11-29 01:40:18,257 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 188 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:40:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:40:26,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:40:31,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:40:51,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:40:55,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:40:59,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:41:02,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:41:06,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:41:12,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:41:16,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:41:36,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 01:41:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:41:36,854 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2023-11-29 01:41:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:41:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 [2023-11-29 01:41:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:41:36,855 INFO L225 Difference]: With dead ends: 33 [2023-11-29 01:41:36,855 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 01:41:36,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=8, NotChecked=28, Total=272 [2023-11-29 01:41:36,856 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 48.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:41:36,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 189 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 10 Unknown, 33 Unchecked, 48.0s Time] [2023-11-29 01:41:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 01:41:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 01:41:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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) [2023-11-29 01:41:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-11-29 01:41:36,863 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 11 [2023-11-29 01:41:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:41:36,864 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-29 01:41:36,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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) [2023-11-29 01:41:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-11-29 01:41:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:41:36,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:41:36,865 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:41:36,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:41:37,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:41:37,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:41:37,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:41:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1945716365, now seen corresponding path program 3 times [2023-11-29 01:41:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:41:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077163101] [2023-11-29 01:41:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:41:37,073 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:41:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451642098] [2023-11-29 01:41:37,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:41:37,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:41:37,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:41:37,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:41:37,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9a6f0850-ede2-4323-b164-2883b67a42cc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:41:37,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 01:41:37,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:41:37,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 01:41:37,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:26,131 WARN L293 SmtUtils]: Spent 15.64s on a formula simplification. DAG size of input: 80 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:43:09,914 WARN L293 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:43:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:14,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:46:25,685 WARN L293 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 88 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:51:04,631 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse5 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse4 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse1 (+ (- 256) .cse0))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse1) 256))) (or (< .cse0 128) (not (= (mod (mod .cse1 .cse2) 256) 0)) (< .cse2 .cse3) (< 127 (mod (+ .cse4 .cse5) 256)) (< 127 (mod .cse4 256)) (= .cse4 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse6) 256))) (or (not (= (mod (mod .cse6 .cse7) 256) 0)) (< (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse6 0) (< 127 (mod (+ .cse8 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse6) (< .cse7 .cse3)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0)))) .cse9) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse13 256))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse11) 256))) (or (not (= (mod (mod .cse11 .cse12) 256) 0)) (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse11 0) (< 127 (mod (+ .cse13 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse11) (< .cse12 .cse3)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ .cse14 .cse5) 256))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse15) 256))) (or (< (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse15 0) (not (= (mod (mod .cse15 .cse16) 256) 0)) (< .cse16 .cse3) (< 127 .cse15) (< 127 (mod .cse14 256)) (= .cse14 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod .cse20 256))) (let ((.cse17 (+ (- 256) .cse19))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse17) 256))) (or (not (= (mod (mod .cse17 .cse18) 256) 0)) (< .cse19 128) (< (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse20 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< .cse18 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (- 256) .cse22))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse23) 256))) (or (< (mod .cse21 256) 128) (< .cse22 128) (not (= (mod (mod .cse23 .cse24) 256) 0)) (< .cse24 .cse3) (< 127 (mod (+ .cse21 .cse5) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse26))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse27) 256))) (or (< (mod .cse25 256) 128) (< .cse26 128) (not (= (mod (mod .cse27 .cse28) 256) 0)) (< .cse28 .cse3) (< (mod (+ .cse25 .cse5) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod .cse32 256))) (let ((.cse29 (+ (- 256) .cse31))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse29) 256))) (or (not (= (mod (mod .cse29 .cse30) 256) 0)) (< .cse31 128) (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse32 .cse5) 256) 128) (< .cse30 .cse3))))))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse35 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse33) 256))) (or (not (= (mod (mod .cse33 .cse34) 256) 0)) (= .cse33 0) (< 127 (mod (+ .cse35 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse33) (< 127 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse34 .cse3)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse36) 256))) (or (not (= (mod (mod .cse36 .cse37) 256) 0)) (< .cse37 .cse3) (= 0 .cse36) (< 127 (mod (+ .cse38 .cse5) 256)) (< 127 (mod .cse38 256)) (< 127 .cse36) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse39) 256))) (or (not (= (mod (mod .cse39 .cse40) 256) 0)) (< .cse40 .cse3) (= 0 .cse39) (< 127 (mod .cse41 256)) (< 127 .cse39) (< (mod (+ .cse41 .cse5) 256) 128) (= .cse41 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse42) 256))) (or (not (= (mod (mod .cse42 .cse43) 256) 0)) (= .cse42 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse42) (< 127 (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse43 .cse3) (< (mod (+ .cse44 .cse5) 256) 128))))))))) .cse9) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse5) 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse46) 256))) (or (< (mod .cse45 256) 128) (= .cse46 0) (not (= (mod (mod .cse46 .cse47) 256) 0)) (< .cse47 .cse3) (< 127 .cse46) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod .cse51 256))) (let ((.cse48 (+ (- 256) .cse50))) (let ((.cse49 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse48) 256))) (or (not (= (mod (mod .cse48 .cse49) 256) 0)) (< .cse50 128) (< 127 (mod (+ .cse51 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse49 .cse3))))))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse52 (+ (- 256) .cse54))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse52) 256))) (or (not (= (mod (mod .cse52 .cse53) 256) 0)) (< .cse54 128) (< 127 (mod (+ .cse55 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse53 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse56 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse57) 256))) (or (< (mod .cse56 256) 128) (not (= (mod (mod .cse57 .cse58) 256) 0)) (< .cse58 .cse3) (= 0 .cse57) (< 127 (mod (+ .cse56 .cse5) 256)) (< 127 .cse57) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (let ((.cse59 (+ (- 256) .cse61))) (let ((.cse60 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse59) 256))) (or (not (= (mod (mod .cse59 .cse60) 256) 0)) (< .cse61 128) (< (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse62 .cse5) 256) 128) (< .cse60 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod (+ .cse65 .cse5) 256))) (let ((.cse64 (+ (- 256) .cse66))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse64) 256))) (or (< .cse63 .cse3) (not (= (mod (mod .cse64 .cse63) 256) 0)) (< (mod .cse65 256) 128) (< (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse66 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse70 (mod (+ .cse69 .cse5) 256))) (let ((.cse68 (+ (- 256) .cse70))) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse68) 256))) (or (< .cse67 .cse3) (not (= (mod (mod .cse68 .cse67) 256) 0)) (< 127 (mod .cse69 256)) (< 127 (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse70 128) (= .cse69 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse73 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod .cse73 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse71) 256))) (or (not (= (mod (mod .cse71 .cse72) 256) 0)) (= .cse71 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse71) (< 127 (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse72 .cse3) (< (mod (+ .cse73 .cse5) 256) 128))))))))) .cse10) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse76 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod .cse76 256))) (let ((.cse75 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse74) 256))) (or (not (= (mod (mod .cse74 .cse75) 256) 0)) (< (mod (+ .cse76 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse74 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse74) (< .cse75 .cse3) (< (mod (+ .cse76 .cse5) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod (+ .cse79 .cse5) 256))) (let ((.cse78 (+ (- 256) .cse80))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse78) 256))) (or (< .cse77 .cse3) (not (= (mod (mod .cse78 .cse77) 256) 0)) (< (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse79 256)) (< .cse80 128) (= .cse79 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod (+ .cse81 .cse5) 256))) (let ((.cse83 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse82) 256))) (or (< (mod .cse81 256) 128) (< (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse82 0) (not (= (mod (mod .cse82 .cse83) 256) 0)) (< .cse83 .cse3) (< 127 .cse82) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse87 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse86 (mod .cse87 256))) (let ((.cse84 (+ (- 256) .cse86))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse84) 256))) (or (not (= (mod (mod .cse84 .cse85) 256) 0)) (< .cse86 128) (< (mod (+ .cse87 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse87 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< .cse85 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (- 256) .cse90))) (let ((.cse89 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse88) 256))) (or (not (= (mod (mod .cse88 .cse89) 256) 0)) (< .cse90 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse5) 256) 128) (< .cse89 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod (+ .cse94 .cse5) 256))) (let ((.cse93 (+ (- 256) .cse95))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse93) 256))) (or (< .cse92 .cse3) (not (= (mod (mod .cse93 .cse92) 256) 0)) (< (mod .cse94 256) 128) (< 127 (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse95 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse99 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse97 (+ (- 256) .cse96))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse97) 256))) (or (< .cse96 128) (not (= (mod (mod .cse97 .cse98) 256) 0)) (< .cse98 .cse3) (< 127 (mod .cse99 256)) (< (mod (+ .cse99 .cse5) 256) 128) (= .cse99 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse102 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse100 (mod .cse102 256))) (let ((.cse101 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse100) 256))) (or (not (= (mod (mod .cse100 .cse101) 256) 0)) (< (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse100 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse100) (< .cse101 .cse3) (< (mod (+ .cse102 .cse5) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse105 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse103 (mod .cse105 256))) (let ((.cse104 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse103) 256))) (or (not (= (mod (mod .cse103 .cse104) 256) 0)) (= .cse103 0) (< 127 (mod (+ .cse105 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse103) (< 127 (mod (+ .cse105 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse104 .cse3)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse108 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse106 (mod (+ .cse108 .cse5) 256))) (let ((.cse107 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse106) 256))) (or (= .cse106 0) (not (= (mod (mod .cse106 .cse107) 256) 0)) (< .cse107 .cse3) (< 127 .cse106) (< 127 (mod .cse108 256)) (< 127 (mod (+ .cse108 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse112 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse111 (mod .cse112 256))) (let ((.cse109 (+ (- 256) .cse111))) (let ((.cse110 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse109) 256))) (or (not (= (mod (mod .cse109 .cse110) 256) 0)) (< .cse111 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse112 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse112 .cse5) 256) 128) (< .cse110 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse113 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod (+ .cse113 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse115 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse114) 256))) (or (< (mod .cse113 256) 128) (not (= (mod (mod .cse114 .cse115) 256) 0)) (< .cse115 .cse3) (= 0 .cse114) (< 127 .cse114) (< (mod (+ .cse113 .cse5) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-11-29 01:51:47,786 WARN L876 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse4 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse2 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse0) 256))) (or (not (= (mod (mod .cse0 .cse1) 256) 0)) (< (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse0 0) (< 127 (mod (+ .cse2 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse0) (< .cse1 .cse4)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse7 256))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse5) 256))) (or (not (= (mod (mod .cse5 .cse6) 256) 0)) (< (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse5 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse5) (< .cse6 .cse4) (< (mod (+ .cse7 .cse3) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse8 .cse3) 256))) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse9) 256))) (or (< (mod .cse8 256) 128) (= .cse9 0) (not (= (mod (mod .cse9 .cse10) 256) 0)) (< .cse10 .cse4) (< 127 .cse9) (< 127 (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse11 .cse3) 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse12) 256))) (or (< (mod .cse11 256) 128) (< (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse12 0) (not (= (mod (mod .cse12 .cse13) 256) 0)) (< .cse13 .cse4) (< 127 .cse12) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse17 256))) (let ((.cse14 (+ (- 256) .cse16))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse14) 256))) (or (not (= (mod (mod .cse14 .cse15) 256) 0)) (< .cse16 128) (< (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse17 .cse3) 256) 128) (< .cse15 .cse4))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse18 (+ (- 256) .cse20))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse18) 256))) (or (not (= (mod (mod .cse18 .cse19) 256) 0)) (< .cse20 128) (< (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse21 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< .cse19 .cse4))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse24 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse22) 256))) (or (not (= (mod (mod .cse22 .cse23) 256) 0)) (= .cse22 0) (< 127 (mod (+ .cse24 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse23 .cse4)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse27 .cse3) 256))) (let ((.cse26 (+ (- 256) .cse28))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse26) 256))) (or (< .cse25 .cse4) (not (= (mod (mod .cse26 .cse25) 256) 0)) (< (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse27 256)) (< .cse28 128) (= .cse27 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse31 .cse3) 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse29) 256))) (or (= .cse29 0) (not (= (mod (mod .cse29 .cse30) 256) 0)) (< .cse30 .cse4) (< 127 .cse29) (< 127 (mod .cse31 256)) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse34 .cse3) 256))) (let ((.cse33 (+ (- 256) .cse35))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse33) 256))) (or (< .cse32 .cse4) (not (= (mod (mod .cse33 .cse32) 256) 0)) (< 127 (mod .cse34 256)) (< 127 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse35 128) (= .cse34 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse39 256))) (let ((.cse36 (+ (- 256) .cse38))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse36) 256))) (or (not (= (mod (mod .cse36 .cse37) 256) 0)) (< .cse38 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse39 .cse3) 256) 128) (< .cse37 .cse4))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse42 .cse3) 256))) (let ((.cse41 (+ (- 256) .cse43))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse41) 256))) (or (< .cse40 .cse4) (not (= (mod (mod .cse41 .cse40) 256) 0)) (< (mod .cse42 256) 128) (< 127 (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse43 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse46 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod .cse46 256))) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse44) 256))) (or (not (= (mod (mod .cse44 .cse45) 256) 0)) (= .cse44 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse44) (< 127 (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse45 .cse4) (< (mod (+ .cse46 .cse3) 256) 128)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse49 .cse3) 256))) (let ((.cse48 (+ (- 256) .cse50))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse48) 256))) (or (< .cse47 .cse4) (not (= (mod (mod .cse48 .cse47) 256) 0)) (< (mod .cse49 256) 128) (< (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse50 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (let ((.cse51 (+ (- 256) .cse53))) (let ((.cse52 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse51) 256))) (or (not (= (mod (mod .cse51 .cse52) 256) 0)) (< .cse53 128) (< 127 (mod (+ .cse54 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse52 .cse4))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse56 (mod (+ .cse55 .cse3) 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse56) 256))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse56 0) (not (= (mod (mod .cse56 .cse57) 256) 0)) (< .cse57 .cse4) (< 127 .cse56) (< 127 (mod .cse55 256)) (= .cse55 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-11-29 01:52:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 01:52:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:52:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077163101] [2023-11-29 01:52:29,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:52:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451642098] [2023-11-29 01:52:29,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451642098] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:52:29,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:52:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-29 01:52:29,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279143932] [2023-11-29 01:52:29,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:52:29,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 01:52:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:52:29,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:52:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=181, Unknown=10, NotChecked=58, Total=306 [2023-11-29 01:52:29,557 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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) [2023-11-29 01:52:33,903 WARN L876 $PredicateComparison]: unable to prove that (and (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse4 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse2 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse0) 256))) (or (not (= (mod (mod .cse0 .cse1) 256) 0)) (< (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse0 0) (< 127 (mod (+ .cse2 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse0) (< .cse1 .cse4)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse7 256))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse5) 256))) (or (not (= (mod (mod .cse5 .cse6) 256) 0)) (< (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse5 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse5) (< .cse6 .cse4) (< (mod (+ .cse7 .cse3) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse8 .cse3) 256))) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse9) 256))) (or (< (mod .cse8 256) 128) (= .cse9 0) (not (= (mod (mod .cse9 .cse10) 256) 0)) (< .cse10 .cse4) (< 127 .cse9) (< 127 (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse11 .cse3) 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse12) 256))) (or (< (mod .cse11 256) 128) (< (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse12 0) (not (= (mod (mod .cse12 .cse13) 256) 0)) (< .cse13 .cse4) (< 127 .cse12) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod .cse17 256))) (let ((.cse14 (+ (- 256) .cse16))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse14) 256))) (or (not (= (mod (mod .cse14 .cse15) 256) 0)) (< .cse16 128) (< (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse17 .cse3) 256) 128) (< .cse15 .cse4))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse18 (+ (- 256) .cse20))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse18) 256))) (or (not (= (mod (mod .cse18 .cse19) 256) 0)) (< .cse20 128) (< (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse21 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< .cse19 .cse4))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse24 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse22) 256))) (or (not (= (mod (mod .cse22 .cse23) 256) 0)) (= .cse22 0) (< 127 (mod (+ .cse24 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse23 .cse4)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse27 .cse3) 256))) (let ((.cse26 (+ (- 256) .cse28))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse26) 256))) (or (< .cse25 .cse4) (not (= (mod (mod .cse26 .cse25) 256) 0)) (< (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse27 256)) (< .cse28 128) (= .cse27 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse31 .cse3) 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse29) 256))) (or (= .cse29 0) (not (= (mod (mod .cse29 .cse30) 256) 0)) (< .cse30 .cse4) (< 127 .cse29) (< 127 (mod .cse31 256)) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse34 .cse3) 256))) (let ((.cse33 (+ (- 256) .cse35))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse33) 256))) (or (< .cse32 .cse4) (not (= (mod (mod .cse33 .cse32) 256) 0)) (< 127 (mod .cse34 256)) (< 127 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse35 128) (= .cse34 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse39 256))) (let ((.cse36 (+ (- 256) .cse38))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse36) 256))) (or (not (= (mod (mod .cse36 .cse37) 256) 0)) (< .cse38 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse39 .cse3) 256) 128) (< .cse37 .cse4))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse42 .cse3) 256))) (let ((.cse41 (+ (- 256) .cse43))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse41) 256))) (or (< .cse40 .cse4) (not (= (mod (mod .cse41 .cse40) 256) 0)) (< (mod .cse42 256) 128) (< 127 (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse43 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse46 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod .cse46 256))) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse44) 256))) (or (not (= (mod (mod .cse44 .cse45) 256) 0)) (= .cse44 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse44) (< 127 (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse45 .cse4) (< (mod (+ .cse46 .cse3) 256) 128)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse49 .cse3) 256))) (let ((.cse48 (+ (- 256) .cse50))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse48) 256))) (or (< .cse47 .cse4) (not (= (mod (mod .cse48 .cse47) 256) 0)) (< (mod .cse49 256) 128) (< (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse50 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (let ((.cse51 (+ (- 256) .cse53))) (let ((.cse52 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse51) 256))) (or (not (= (mod (mod .cse51 .cse52) 256) 0)) (< .cse53 128) (< 127 (mod (+ .cse54 .cse3) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse52 .cse4))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse56 (mod (+ .cse55 .cse3) 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse56) 256))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse56 0) (not (= (mod (mod .cse56 .cse57) 256) 0)) (< .cse57 .cse4) (< 127 .cse56) (< 127 (mod .cse55 256)) (= .cse55 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2023-11-29 01:52:37,980 WARN L876 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (let ((.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse5 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse4 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse1 (+ (- 256) .cse0))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse1) 256))) (or (< .cse0 128) (not (= (mod (mod .cse1 .cse2) 256) 0)) (< .cse2 .cse3) (< 127 (mod (+ .cse4 .cse5) 256)) (< 127 (mod .cse4 256)) (= .cse4 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse8 256))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse6) 256))) (or (not (= (mod (mod .cse6 .cse7) 256) 0)) (< (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse6 0) (< 127 (mod (+ .cse8 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse6) (< .cse7 .cse3)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0)))) .cse9) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse13 256))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse11) 256))) (or (not (= (mod (mod .cse11 .cse12) 256) 0)) (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse11 0) (< 127 (mod (+ .cse13 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse11) (< .cse12 .cse3)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ .cse14 .cse5) 256))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse15) 256))) (or (< (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse15 0) (not (= (mod (mod .cse15 .cse16) 256) 0)) (< .cse16 .cse3) (< 127 .cse15) (< 127 (mod .cse14 256)) (= .cse14 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod .cse20 256))) (let ((.cse17 (+ (- 256) .cse19))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse17) 256))) (or (not (= (mod (mod .cse17 .cse18) 256) 0)) (< .cse19 128) (< (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse20 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< .cse18 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (- 256) .cse22))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse23) 256))) (or (< (mod .cse21 256) 128) (< .cse22 128) (not (= (mod (mod .cse23 .cse24) 256) 0)) (< .cse24 .cse3) (< 127 (mod (+ .cse21 .cse5) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse26))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse27) 256))) (or (< (mod .cse25 256) 128) (< .cse26 128) (not (= (mod (mod .cse27 .cse28) 256) 0)) (< .cse28 .cse3) (< (mod (+ .cse25 .cse5) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod .cse32 256))) (let ((.cse29 (+ (- 256) .cse31))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse29) 256))) (or (not (= (mod (mod .cse29 .cse30) 256) 0)) (< .cse31 128) (< (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse32 .cse5) 256) 128) (< .cse30 .cse3))))))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse35 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse33) 256))) (or (not (= (mod (mod .cse33 .cse34) 256) 0)) (= .cse33 0) (< 127 (mod (+ .cse35 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse33) (< 127 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse34 .cse3)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse36) 256))) (or (not (= (mod (mod .cse36 .cse37) 256) 0)) (< .cse37 .cse3) (= 0 .cse36) (< 127 (mod (+ .cse38 .cse5) 256)) (< 127 (mod .cse38 256)) (< 127 .cse36) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse39) 256))) (or (not (= (mod (mod .cse39 .cse40) 256) 0)) (< .cse40 .cse3) (= 0 .cse39) (< 127 (mod .cse41 256)) (< 127 .cse39) (< (mod (+ .cse41 .cse5) 256) 128) (= .cse41 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse42) 256))) (or (not (= (mod (mod .cse42 .cse43) 256) 0)) (= .cse42 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse42) (< 127 (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse43 .cse3) (< (mod (+ .cse44 .cse5) 256) 128))))))))) .cse9) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse5) 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse46) 256))) (or (< (mod .cse45 256) 128) (= .cse46 0) (not (= (mod (mod .cse46 .cse47) 256) 0)) (< .cse47 .cse3) (< 127 .cse46) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod .cse51 256))) (let ((.cse48 (+ (- 256) .cse50))) (let ((.cse49 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse48) 256))) (or (not (= (mod (mod .cse48 .cse49) 256) 0)) (< .cse50 128) (< 127 (mod (+ .cse51 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse49 .cse3))))))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse52 (+ (- 256) .cse54))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse52) 256))) (or (not (= (mod (mod .cse52 .cse53) 256) 0)) (< .cse54 128) (< 127 (mod (+ .cse55 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse53 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse56 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse57) 256))) (or (< (mod .cse56 256) 128) (not (= (mod (mod .cse57 .cse58) 256) 0)) (< .cse58 .cse3) (= 0 .cse57) (< 127 (mod (+ .cse56 .cse5) 256)) (< 127 .cse57) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (let ((.cse59 (+ (- 256) .cse61))) (let ((.cse60 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse59) 256))) (or (not (= (mod (mod .cse59 .cse60) 256) 0)) (< .cse61 128) (< (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse62 .cse5) 256) 128) (< .cse60 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod (+ .cse65 .cse5) 256))) (let ((.cse64 (+ (- 256) .cse66))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse64) 256))) (or (< .cse63 .cse3) (not (= (mod (mod .cse64 .cse63) 256) 0)) (< (mod .cse65 256) 128) (< (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse66 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse70 (mod (+ .cse69 .cse5) 256))) (let ((.cse68 (+ (- 256) .cse70))) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse68) 256))) (or (< .cse67 .cse3) (not (= (mod (mod .cse68 .cse67) 256) 0)) (< 127 (mod .cse69 256)) (< 127 (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse70 128) (= .cse69 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse73 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod .cse73 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse71) 256))) (or (not (= (mod (mod .cse71 .cse72) 256) 0)) (= .cse71 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse71) (< 127 (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse72 .cse3) (< (mod (+ .cse73 .cse5) 256) 128))))))))) .cse10) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse76 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod .cse76 256))) (let ((.cse75 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse74) 256))) (or (not (= (mod (mod .cse74 .cse75) 256) 0)) (< (mod (+ .cse76 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse74 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse74) (< .cse75 .cse3) (< (mod (+ .cse76 .cse5) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod (+ .cse79 .cse5) 256))) (let ((.cse78 (+ (- 256) .cse80))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse78) 256))) (or (< .cse77 .cse3) (not (= (mod (mod .cse78 .cse77) 256) 0)) (< (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse79 256)) (< .cse80 128) (= .cse79 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod (+ .cse81 .cse5) 256))) (let ((.cse83 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse82) 256))) (or (< (mod .cse81 256) 128) (< (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse82 0) (not (= (mod (mod .cse82 .cse83) 256) 0)) (< .cse83 .cse3) (< 127 .cse82) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse87 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse86 (mod .cse87 256))) (let ((.cse84 (+ (- 256) .cse86))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse84) 256))) (or (not (= (mod (mod .cse84 .cse85) 256) 0)) (< .cse86 128) (< (mod (+ .cse87 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse87 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< .cse85 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (- 256) .cse90))) (let ((.cse89 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse88) 256))) (or (not (= (mod (mod .cse88 .cse89) 256) 0)) (< .cse90 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse5) 256) 128) (< .cse89 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod (+ .cse94 .cse5) 256))) (let ((.cse93 (+ (- 256) .cse95))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse93) 256))) (or (< .cse92 .cse3) (not (= (mod (mod .cse93 .cse92) 256) 0)) (< (mod .cse94 256) 128) (< 127 (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse95 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse99 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse97 (+ (- 256) .cse96))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse97) 256))) (or (< .cse96 128) (not (= (mod (mod .cse97 .cse98) 256) 0)) (< .cse98 .cse3) (< 127 (mod .cse99 256)) (< (mod (+ .cse99 .cse5) 256) 128) (= .cse99 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse102 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse100 (mod .cse102 256))) (let ((.cse101 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse100) 256))) (or (not (= (mod (mod .cse100 .cse101) 256) 0)) (< (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse100 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse100) (< .cse101 .cse3) (< (mod (+ .cse102 .cse5) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse105 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse103 (mod .cse105 256))) (let ((.cse104 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse103) 256))) (or (not (= (mod (mod .cse103 .cse104) 256) 0)) (= .cse103 0) (< 127 (mod (+ .cse105 .cse5) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse103) (< 127 (mod (+ .cse105 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse104 .cse3)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse108 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse106 (mod (+ .cse108 .cse5) 256))) (let ((.cse107 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse106) 256))) (or (= .cse106 0) (not (= (mod (mod .cse106 .cse107) 256) 0)) (< .cse107 .cse3) (< 127 .cse106) (< 127 (mod .cse108 256)) (< 127 (mod (+ .cse108 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse112 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse111 (mod .cse112 256))) (let ((.cse109 (+ (- 256) .cse111))) (let ((.cse110 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse109) 256))) (or (not (= (mod (mod .cse109 .cse110) 256) 0)) (< .cse111 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse112 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse112 .cse5) 256) 128) (< .cse110 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse113 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod (+ .cse113 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse115 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse114) 256))) (or (< (mod .cse113 256) 128) (not (= (mod (mod .cse114 .cse115) 256) 0)) (< .cse115 .cse3) (= 0 .cse114) (< 127 .cse114) (< (mod (+ .cse113 .cse5) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2023-11-29 01:52:39,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 01:52:42,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:52:44,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 01:52:48,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:52:53,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:52:58,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]