./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd --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 1a2810bb21e6de0cf080b546d334e2bc4a7723a0569c58531da7e4847e328a8e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:37:18,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:37:18,580 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:37:18,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:37:18,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:37:18,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:37:18,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:37:18,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:37:18,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:37:18,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:37:18,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:37:18,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:37:18,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:37:18,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:37:18,643 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:37:18,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:37:18,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:37:18,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:37:18,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:37:18,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:37:18,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:37:18,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:37:18,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:37:18,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:37:18,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:37:18,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:37:18,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:37:18,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:37:18,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1a2810bb21e6de0cf080b546d334e2bc4a7723a0569c58531da7e4847e328a8e [2024-11-13 15:37:18,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:37:19,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:37:19,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:37:19,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:37:19,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:37:19,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_2+newton_3_2.i Unable to find full path for "g++" [2024-11-13 15:37:21,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:37:21,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:37:21,691 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i [2024-11-13 15:37:21,735 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/data/b3a6699f3/5694b59bece0474ba668c936cfda2334/FLAG47dfe15ef [2024-11-13 15:37:21,774 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/data/b3a6699f3/5694b59bece0474ba668c936cfda2334 [2024-11-13 15:37:21,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:37:21,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:37:21,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:37:21,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:37:21,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:37:21,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:37:21" (1/1) ... [2024-11-13 15:37:21,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5972543c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:21, skipping insertion in model container [2024-11-13 15:37:21,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:37:21" (1/1) ... [2024-11-13 15:37:21,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:37:22,043 WARN L250 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_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[1226,1239] [2024-11-13 15:37:22,100 WARN L250 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_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[2862,2875] [2024-11-13 15:37:22,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:37:22,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:37:22,137 WARN L250 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_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[1226,1239] [2024-11-13 15:37:22,161 WARN L250 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_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/sv-benchmarks/c/combinations/gcd_2+newton_3_2.i[2862,2875] [2024-11-13 15:37:22,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:37:22,181 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:37:22,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22 WrapperNode [2024-11-13 15:37:22,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:37:22,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:37:22,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:37:22,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:37:22,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,233 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2024-11-13 15:37:22,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:37:22,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:37:22,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:37:22,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:37:22,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,279 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]. [2024-11-13 15:37:22,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:37:22,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:37:22,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:37:22,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:37:22,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (1/1) ... [2024-11-13 15:37:22,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:37:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:37:22,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:37:22,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:37:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:37:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 15:37:22,392 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 15:37:22,393 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 15:37:22,393 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 15:37:22,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:37:22,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:37:22,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:37:22,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:37:22,486 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:37:22,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:37:22,797 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-13 15:37:22,801 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:37:22,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:37:22,817 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:37:22,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:37:22 BoogieIcfgContainer [2024-11-13 15:37:22,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:37:22,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:37:22,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:37:22,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:37:22,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:37:21" (1/3) ... [2024-11-13 15:37:22,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf37a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:37:22, skipping insertion in model container [2024-11-13 15:37:22,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:37:22" (2/3) ... [2024-11-13 15:37:22,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf37a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:37:22, skipping insertion in model container [2024-11-13 15:37:22,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:37:22" (3/3) ... [2024-11-13 15:37:22,831 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_2.i [2024-11-13 15:37:22,850 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:37:22,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_3_2.i that has 3 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 15:37:22,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:37:22,956 INFO L333 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, 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;@40d3c6b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:37:22,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 15:37:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:37:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:37:22,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:37:22,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:22,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:37:22,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 15:37:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513261427] [2024-11-13 15:37:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:23,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513261427] [2024-11-13 15:37:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513261427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:37:23,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:37:23,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:37:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895371602] [2024-11-13 15:37:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:37:23,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:37:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:37:23,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:37:23,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:37:23,470 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:37:23,563 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-13 15:37:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:37:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:37:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:37:23,574 INFO L225 Difference]: With dead ends: 78 [2024-11-13 15:37:23,574 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 15:37:23,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:37:23,581 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:37:23,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:37:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 15:37:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-13 15:37:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:37:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-13 15:37:23,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-13 15:37:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:37:23,623 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-13 15:37:23,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-13 15:37:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 15:37:23,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:37:23,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:23,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:37:23,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:37:23,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash 36038583, now seen corresponding path program 1 times [2024-11-13 15:37:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104578710] [2024-11-13 15:37:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104578710] [2024-11-13 15:37:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104578710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:37:23,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:37:23,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:37:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449223228] [2024-11-13 15:37:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:37:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:37:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:37:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:37:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:37:23,862 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:37:23,892 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-13 15:37:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:37:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 15:37:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:37:23,893 INFO L225 Difference]: With dead ends: 39 [2024-11-13 15:37:23,893 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 15:37:23,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:37:23,895 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:37:23,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:37:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 15:37:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 15:37:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:37:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-13 15:37:23,904 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-13 15:37:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:37:23,904 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-13 15:37:23,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-13 15:37:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 15:37:23,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:37:23,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:23,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:37:23,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:37:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1576478087, now seen corresponding path program 1 times [2024-11-13 15:37:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915557116] [2024-11-13 15:37:23,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915557116] [2024-11-13 15:37:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915557116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:37:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644418660] [2024-11-13 15:37:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:37:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:37:24,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:37:24,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:37:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:24,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 15:37:24,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:37:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:24,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:37:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644418660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:37:24,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:37:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-13 15:37:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779688504] [2024-11-13 15:37:24,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:37:24,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:37:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:37:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:37:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:37:24,765 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:37:24,941 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-13 15:37:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:37:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 15:37:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:37:24,943 INFO L225 Difference]: With dead ends: 40 [2024-11-13 15:37:24,943 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 15:37:24,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:37:24,945 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:37:24,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:37:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 15:37:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 15:37:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:37:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-13 15:37:24,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2024-11-13 15:37:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:37:24,952 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-13 15:37:24,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:37:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-13 15:37:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 15:37:24,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:37:24,953 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:37:24,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:37:25,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:37:25,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:37:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:37:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -24887305, now seen corresponding path program 2 times [2024-11-13 15:37:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:37:25,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186462019] [2024-11-13 15:37:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:37:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:37:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:37:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:37:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:37:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186462019] [2024-11-13 15:37:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186462019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:37:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307305822] [2024-11-13 15:37:25,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:37:25,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:37:25,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:37:25,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:37:25,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:37:26,123 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:37:26,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:37:26,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 15:37:26,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:38:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:38:32,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:39:19,041 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:39:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:39:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307305822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:39:39,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:39:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-13 15:39:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568252066] [2024-11-13 15:39:39,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:39:39,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 15:39:39,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:39,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 15:39:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=442, Unknown=17, NotChecked=0, Total=552 [2024-11-13 15:39:39,291 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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) [2024-11-13 15:39:43,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:39:47,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:39:53,313 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] [2024-11-13 15:39:57,521 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] [2024-11-13 15:40:02,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:40:07,461 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, 1] [2024-11-13 15:40:09,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 15:40:13,862 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] [2024-11-13 15:40:18,149 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] [2024-11-13 15:40:29,061 WARN L286 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 111 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:40:34,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-13 15:40:38,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:40:42,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-13 15:40:47,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 15:40:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:50,666 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-13 15:40:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:40:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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 13 [2024-11-13 15:40:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:50,667 INFO L225 Difference]: With dead ends: 50 [2024-11-13 15:40:50,668 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 15:40:50,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 107.5s TimeCoverageRelationStatistics Valid=121, Invalid=563, Unknown=18, NotChecked=0, Total=702 [2024-11-13 15:40:50,669 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:50,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 12 Unknown, 0 Unchecked, 58.4s Time] [2024-11-13 15:40:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 15:40:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 15:40:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:40:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-13 15:40:50,682 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2024-11-13 15:40:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:50,682 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-13 15:40:50,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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) [2024-11-13 15:40:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-13 15:40:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 15:40:50,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:50,683 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:50,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:50,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:50,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:40:50,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash -710557577, now seen corresponding path program 3 times [2024-11-13 15:40:50,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749477141] [2024-11-13 15:40:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:40:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749477141] [2024-11-13 15:40:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749477141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874564446] [2024-11-13 15:40:58,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 15:40:58,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:58,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:58,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:58,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf46ccc-e8f5-405d-a3d8-7c900de46d9e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:40:58,666 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 15:40:58,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:40:58,669 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 15:40:58,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:41:13,410 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (<= .cse0 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod (+ .cse4 .cse3) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse1 .cse2) (not (= .cse3 0)) (<= 128 .cse2))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse6 (mod (+ .cse4 .cse5) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse6) (<= .cse6 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= .cse1 .cse7) (<= 128 .cse7) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|)))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse21 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse42 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse43 (mod .cse21 256))) (let ((.cse30 (<= 128 .cse43)) (.cse20 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse28 (<= 128 .cse42)) (.cse39 (<= .cse43 127)) (.cse29 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse31 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))) (.cse34 (<= .cse42 127))) (let ((.cse14 (or (and .cse39 .cse29 .cse31 .cse34) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse40 (mod .cse41 256))) (and (<= .cse40 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse40) (<= (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse41 .cse21) 256) 127))))))) (.cse13 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse38 (mod .cse37 256))) (and (<= 128 (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse38 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse38) (<= (mod (+ .cse37 .cse21) 256) 127))))) (and .cse28 .cse39 .cse29 .cse31))) (.cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse35 (mod .cse36 256))) (and (<= 128 .cse35) (= .cse35 .cse20) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ .cse36 .cse21) 256) 127)))))) (.cse10 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse32 (mod .cse33 256))) (and (<= .cse32 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse32) (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse33 .cse21) 256)))))) (and .cse29 .cse30 .cse31 .cse34))) (.cse9 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse27 (mod .cse26 256))) (and (<= 128 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse27 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse27) (<= 128 (mod (+ .cse26 .cse21) 256)))))) (and .cse28 .cse29 .cse30 .cse31))) (.cse8 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse25 (mod .cse24 256))) (and (<= 128 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse25) (= .cse25 .cse20) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse24 .cse21) 256) 127)))))) (.cse16 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse22 (mod .cse23 256))) (and (<= 128 .cse22) (= .cse22 .cse20) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= 128 (mod (+ .cse23 .cse21) 256))))))) (.cse12 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse19 (mod .cse18 256))) (and (<= 128 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse19) (= .cse19 .cse20) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (mod (+ .cse18 .cse21) 256)))))))) (or (and .cse8 .cse9) (and .cse8 .cse10) (and .cse11 .cse8) (and .cse12 .cse13) (and .cse12 .cse14) (and .cse8 .cse14) (and .cse15 .cse8) (and .cse8 .cse13) (and .cse15 .cse12) (and .cse12 .cse10) (and .cse8 .cse16) (and .cse12 .cse9) (and .cse8 .cse17) (and .cse11 .cse12) (and .cse12 .cse16) (and .cse12 .cse17)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-11-13 15:42:29,059 WARN L286 SmtUtils]: Spent 14.99s on a formula simplification that was a NOOP. DAG size: 142 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:43:16,156 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse3 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse13 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod .cse1 256))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse2))) (and (<= (mod (+ .cse0 .cse1) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse2 (mod .cse0 256))) (<= .cse2 127) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse0 0)) (<= 128 (mod (+ (* 255 .cse1) .cse0) 256))))))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod .cse6 256))) (and (<= .cse4 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse4))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse4 (mod .cse5 256))) (<= 128 (mod (+ .cse5 .cse6) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (mod .cse7 256))) (let ((.cse12 (+ (- 256) .cse9))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse12))) (let ((.cse10 (mod .cse12 (mod .cse8 256)))) (and (<= 128 (mod (+ (* 255 .cse7) .cse8) 256)) (<= 128 .cse9) (not (= .cse8 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse10 0)) (= .cse11 (mod (+ (* .cse8 255) .cse10) 256)) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse16 (mod (+ .cse13 .cse15) 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse16))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse13 .cse14 .cse15) 256) 127) (not (= .cse16 0)) (not (= .cse15 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse16 (mod .cse14 256))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse16 127) (not (= .cse14 0)) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod (+ .cse13 .cse19) 256))) (let ((.cse21 (+ (- 256) .cse20))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse21))) (let ((.cse18 (mod .cse21 (mod .cse17 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= .cse11 (mod (+ .cse18 (* 255 .cse17)) 256)) (not (= .cse18 0)) (<= 128 (mod (+ (* 255 .cse19) |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256)) (not (= .cse19 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 .cse20) (not (= .cse17 0))))))))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse22 (mod .cse23 256))) (and (<= 128 .cse22) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse26 (+ (- 256) .cse22))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse25 (mod .cse26 (mod .cse24 256)))) (and (<= 128 (mod (+ (* 255 .cse23) .cse24) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse24 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse25 0)) (= .cse11 (mod (+ (* .cse24 255) .cse25) 256))))))))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse27 (mod .cse29 256))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse27))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse27 (mod .cse28 256))) (<= 128 (mod (+ .cse28 .cse29) 256)) (<= .cse27 127) (<= .cse28 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (mod .cse30 256))) (let ((.cse34 (+ (- 256) .cse32))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse34))) (let ((.cse33 (mod .cse34 (mod .cse31 256)))) (and (<= (mod (+ (* 255 .cse30) .cse31) 256) 127) (<= 128 .cse32) (not (= .cse31 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse33 0)) (= .cse11 (mod (+ (* .cse31 255) .cse33) 256)) (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) .cse3) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse37 (mod (+ .cse13 .cse36) 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse37))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ .cse13 .cse35 .cse36) 256)) (not (= .cse36 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse37 (mod .cse35 256))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse37 127) (<= .cse35 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse42 (mod .cse38 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse41 (+ (- 256) .cse42))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse41))) (let ((.cse40 (mod .cse41 (mod .cse39 256)))) (and (<= (mod (+ (* 255 .cse38) .cse39) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse39 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse39 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse40 0)) (= .cse11 (mod (+ (* .cse39 255) .cse40) 256))))))) (<= 128 .cse42) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (mod (+ .cse13 .cse43) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse43 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse46 (+ (- 256) .cse47))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse46))) (let ((.cse44 (mod .cse46 (mod .cse45 256)))) (and (= .cse11 (mod (+ .cse44 (* 255 .cse45)) 256)) (not (= .cse44 0)) (<= 128 (mod (+ (* 255 .cse43) |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse45 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (not (= .cse45 0))))))) (<= 128 .cse47))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (mod (+ .cse13 .cse49) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse50))) (and (<= (mod (+ .cse13 .cse48 .cse49) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse50 (mod .cse48 256))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse48 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse48 0))))) (not (= .cse50 0)) (not (= .cse49 0)) (<= .cse50 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse54 (mod (+ .cse13 .cse53) 256))) (let ((.cse55 (+ (- 256) .cse54))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse55))) (let ((.cse52 (mod .cse55 (mod .cse51 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= .cse11 (mod (+ .cse52 (* 255 .cse51)) 256)) (not (= .cse52 0)) (not (= .cse53 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 .cse54) (<= (mod (+ (* 255 .cse53) |c_ULTIMATE.start_main1_~y~0#1| .cse51) 256) 127) (not (= .cse51 0))))))))) .cse3) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse60 (mod (+ .cse13 .cse58) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse59 (+ (- 256) .cse60))) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse59))) (let ((.cse56 (mod .cse59 (mod .cse57 256)))) (and (= .cse11 (mod (+ .cse56 (* 255 .cse57)) 256)) (not (= .cse56 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse57 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (<= (mod (+ (* 255 .cse58) |c_ULTIMATE.start_main1_~y~0#1| .cse57) 256) 127) (not (= .cse57 0))))))) (not (= .cse58 0)) (<= 128 .cse60))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse62 (mod (+ .cse13 .cse61) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse61 0)) (<= .cse62 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse62))) (and (<= 128 (mod (+ .cse13 .cse63 .cse61) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse62 (mod .cse63 256))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse63 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse64 (mod .cse66 256))) (and (<= .cse64 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse64))) (and (<= (mod (+ .cse65 .cse66) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse64 (mod .cse65 256))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse65 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse65 0)) (<= 128 (mod (+ (* 255 .cse66) .cse65) 256))))))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 15:44:29,378 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse10 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (<= (mod |c_ULTIMATE.start_gcd_test_~a#1| 256) 127)) (.cse40 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse42 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod (+ .cse0 .cse2) 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse4))) (let ((.cse3 (mod .cse4 (mod .cse1 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse0 .cse1 .cse2) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse4 0)) (not (= .cse2 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse4 127) (not (= .cse3 0)) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse9))) (let ((.cse6 (mod .cse9 (mod .cse7 256)))) (and (= (mod .cse6 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ .cse7 .cse8) 256)) (<= .cse9 127) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse6 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse6)))))))) .cse10 .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (mod (+ .cse0 .cse14) 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse15))) (let ((.cse12 (mod .cse15 (mod .cse13 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 128 (mod (+ .cse0 .cse13 .cse14) 256)) (not (= .cse14 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse15 127) (not (= .cse12 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse12) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse18 (mod .cse17 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse18))) (let ((.cse19 (mod .cse18 (mod .cse16 256)))) (and (<= (mod (+ .cse16 .cse17) 256) 127) (<= .cse18 127) (<= .cse16 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse19 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse16 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19)) (<= 128 (mod (+ (* 255 .cse17) .cse16) 256)))))))) .cse5) (and .cse10 .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse24 (mod (+ .cse0 .cse23) 256))) (let ((.cse25 (+ (- 256) .cse24))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse25))) (let ((.cse22 (mod .cse25 (mod .cse20 256)))) (let ((.cse21 (+ (mod (+ .cse22 (* 255 .cse20)) 256) (- 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse20 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse22 0)) (<= 128 (mod (+ (* 255 .cse23) |c_ULTIMATE.start_main1_~y~0#1| .cse20) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse23 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse24) (not (= .cse20 0))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod .cse27 256))) (let ((.cse31 (+ (- 256) .cse29))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse31))) (let ((.cse30 (mod .cse31 (mod .cse28 256)))) (let ((.cse26 (+ (mod (+ (* .cse28 255) .cse30) 256) (- 256)))) (and (= (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (mod (+ (* 255 .cse27) .cse28) 256) 127) (<= 128 .cse29) (not (= .cse28 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse26)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse30 0)) (<= .cse28 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse10 .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse34 (mod (+ .cse0 .cse33) 256))) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse34))) (let ((.cse35 (mod .cse34 (mod .cse32 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse0 .cse32 .cse33) 256) 127) (not (= .cse34 0)) (not (= .cse33 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse34 127) (= (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse35 0)) (not (= .cse32 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) .cse10 .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse38 (mod (+ .cse0 .cse37) 256))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse38))) (let ((.cse39 (mod .cse38 (mod .cse36 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= 128 (mod (+ .cse0 .cse36 .cse37) 256)) (not (= .cse37 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse38 127) (= (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse39 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse36 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) .cse10 .cse11) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (mod (+ .cse0 .cse45) 256))) (let ((.cse48 (+ (- 256) .cse47))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse48))) (let ((.cse44 (mod .cse48 (mod .cse43 256)))) (let ((.cse46 (+ (mod (+ .cse44 (* 255 .cse43)) 256) (- 256)))) (let ((.cse41 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod (+ .cse40 .cse41) 256) .cse42) (<= .cse43 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse44 0)) (<= 128 (mod (+ (* 255 .cse45) |c_ULTIMATE.start_main1_~y~0#1| .cse43) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse46) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse45 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse47) (not (= .cse43 0)) (not (= .cse41 0)))))))))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse54 (mod (+ .cse0 .cse53) 256))) (let ((.cse55 (+ (- 256) .cse54))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse55))) (let ((.cse51 (mod .cse55 (mod .cse50 256)))) (let ((.cse52 (+ (mod (+ .cse51 (* 255 .cse50)) 256) (- 256)))) (let ((.cse49 (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod (+ .cse40 .cse49) 256) .cse42) (<= .cse50 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse51 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse53 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse54) (<= (mod (+ (* 255 .cse53) |c_ULTIMATE.start_main1_~y~0#1| .cse50) 256) 127) (not (= .cse50 0)) (not (= .cse49 0)))))))))))) (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse59 (mod .cse57 256))) (let ((.cse61 (+ (- 256) .cse59))) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse61))) (let ((.cse60 (mod .cse61 (mod .cse58 256)))) (let ((.cse56 (+ (mod (+ (* .cse58 255) .cse60) 256) (- 256)))) (and (= (mod .cse56 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ (* 255 .cse57) .cse58) 256)) (<= 128 .cse59) (not (= .cse58 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse56)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse60 0)) (<= .cse58 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse11) (and .cse10 .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse65 (mod .cse63 256))) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse65))) (let ((.cse64 (mod .cse65 (mod .cse62 256)))) (and (<= (mod (+ .cse62 .cse63) 256) 127) (= (mod .cse64 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse65 127) (<= .cse62 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse64 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse62 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse64)) (<= 128 (mod (+ (* 255 .cse63) .cse62) 256))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse69 (mod .cse67 256))) (let ((.cse72 (+ (- 256) .cse69))) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse72))) (let ((.cse71 (mod .cse72 (mod .cse68 256)))) (let ((.cse70 (+ (mod (+ (* .cse68 255) .cse71) 256) (- 256)))) (let ((.cse66 (mod .cse70 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse40 .cse66) 256) .cse42) (<= 128 (mod (+ (* 255 .cse67) .cse68) 256)) (<= 128 .cse69) (not (= .cse68 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse70)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse71 0)) (not (= .cse66 0)) (<= .cse68 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))) .cse5) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse74 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse75 (mod .cse74 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse75))) (let ((.cse76 (mod .cse75 (mod .cse73 256)))) (and (<= 128 (mod (+ .cse73 .cse74) 256)) (<= .cse75 127) (<= .cse73 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse76 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse76 |c_ULTIMATE.start_gcd_test_~a#1|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse76))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse80 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse81 (mod (+ .cse0 .cse80) 256))) (let ((.cse82 (+ (- 256) .cse81))) (let ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse82))) (let ((.cse79 (mod .cse82 (mod .cse77 256)))) (let ((.cse78 (+ (mod (+ .cse79 (* 255 .cse77)) 256) (- 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse77 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse78 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse79 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse78) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse80 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse81) (<= (mod (+ (* 255 .cse80) |c_ULTIMATE.start_main1_~y~0#1| .cse77) 256) 127) (not (= .cse77 0)))))))))) .cse10 .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse86 (mod .cse84 256))) (let ((.cse89 (+ (- 256) .cse86))) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse89))) (let ((.cse88 (mod .cse89 (mod .cse85 256)))) (let ((.cse87 (+ (mod (+ (* .cse85 255) .cse88) 256) (- 256)))) (let ((.cse83 (mod .cse87 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse40 .cse83) 256) .cse42) (<= (mod (+ (* 255 .cse84) .cse85) 256) 127) (<= 128 .cse86) (not (= .cse85 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse87)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse88 0)) (not (= .cse83 0)) (<= .cse85 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))) .cse5))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 15:45:24,457 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse12 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse6 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse21 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (mod .cse2 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse5))) (let ((.cse3 (mod .cse5 (mod .cse1 256)))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3))) (and (<= 128 (mod (+ .cse1 .cse2) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse3 .cse4)) (<= .cse5 127) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse4 0)) (= (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|))))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (mod (+ .cse6 .cse8) 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse9))) (let ((.cse11 (mod .cse9 (mod .cse7 256)))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse6 .cse7 .cse8) 256) 127) (not (= .cse9 0)) (not (= .cse10 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse11 .cse10)) (not (= .cse8 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse9 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse10 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse7 0)) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse18 (mod (+ .cse6 .cse17) 256))) (let ((.cse20 (+ (- 256) .cse18))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse20))) (let ((.cse16 (mod .cse20 (mod .cse15 256)))) (let ((.cse19 (+ (mod (+ .cse16 (* 255 .cse15)) 256) (- 256)))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19))) (let ((.cse14 (mod .cse19 .cse13))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse12 (mod (+ (* .cse13 255) .cse14) 256)) (not (= .cse14 0)) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse16 0)) (<= 128 (mod (+ (* 255 .cse17) |c_ULTIMATE.start_main1_~y~0#1| .cse15) 256)) (not (= .cse17 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse18) (= (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse15 0)) (not (= .cse13 0)))))))))))) .cse21) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse26 (mod .cse24 256))) (let ((.cse29 (+ (- 256) .cse26))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse29))) (let ((.cse27 (mod .cse29 (mod .cse25 256)))) (let ((.cse28 (+ (mod (+ (* .cse25 255) .cse27) 256) (- 256)))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse28))) (let ((.cse22 (mod .cse28 .cse23))) (and (= .cse12 (mod (+ .cse22 (* 255 .cse23)) 256)) (<= 128 (mod (+ (* 255 .cse24) .cse25) 256)) (= (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 .cse26) (not (= .cse25 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse23 0)) (not (= .cse27 0)) (not (= .cse22 0)) (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse21) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse34 (mod .cse32 256))) (let ((.cse37 (+ (- 256) .cse34))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse37))) (let ((.cse35 (mod .cse37 (mod .cse33 256)))) (let ((.cse36 (+ (mod (+ (* .cse33 255) .cse35) 256) (- 256)))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36))) (let ((.cse30 (mod .cse36 .cse31))) (and (= .cse12 (mod (+ .cse30 (* 255 .cse31)) 256)) (<= (mod (+ (* 255 .cse32) .cse33) 256) 127) (= (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 .cse34) (not (= .cse33 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse31 0)) (not (= .cse35 0)) (not (= .cse30 0)) (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse21) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse42 (mod (+ .cse6 .cse41) 256))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse42))) (let ((.cse39 (mod .cse42 (mod .cse40 256)))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse38 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse39 .cse38)) (<= 128 (mod (+ .cse6 .cse40 .cse41) 256)) (not (= .cse41 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse42 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse38 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod (+ .cse6 .cse47) 256))) (let ((.cse50 (+ (- 256) .cse48))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse50))) (let ((.cse46 (mod .cse50 (mod .cse45 256)))) (let ((.cse49 (+ (mod (+ .cse46 (* 255 .cse45)) 256) (- 256)))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse49))) (let ((.cse44 (mod .cse49 .cse43))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse12 (mod (+ (* .cse43 255) .cse44) 256)) (not (= .cse44 0)) (<= .cse45 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse46 0)) (not (= .cse47 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse48) (<= (mod (+ (* 255 .cse47) |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256) 127) (= (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse45 0)) (not (= .cse43 0)))))))))))) .cse21) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse55 (mod .cse52 256))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse55))) (let ((.cse53 (mod .cse55 (mod .cse51 256)))) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53))) (and (<= (mod (+ .cse51 .cse52) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse53 .cse54)) (<= .cse55 127) (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse54 0)) (= (mod .cse54 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse51 0)) (<= 128 (mod (+ (* 255 .cse52) .cse51) 256))))))))) .cse0))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 15:45:46,565 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse15 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse32 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse5 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod .cse2 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse4))) (let ((.cse3 (mod .cse4 (mod .cse1 256)))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3))) (and (= (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ .cse1 .cse2) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse3 .cse0)) (<= .cse4 127) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse0 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (mod .cse9 256))) (let ((.cse14 (+ (- 256) .cse11))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse14))) (let ((.cse12 (mod .cse14 (mod .cse10 256)))) (let ((.cse13 (+ (mod (+ (* .cse10 255) .cse12) 256) (- 256)))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse13))) (let ((.cse7 (mod .cse13 .cse8))) (and (= .cse6 (mod (+ .cse7 (* 255 .cse8)) 256)) (<= 128 (mod (+ (* 255 .cse9) .cse10) 256)) (<= 128 .cse11) (not (= .cse10 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse8 0)) (not (= .cse12 0)) (= (mod .cse8 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse7 0)) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse15) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod .cse18 256))) (let ((.cse23 (+ (- 256) .cse20))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse23))) (let ((.cse21 (mod .cse23 (mod .cse19 256)))) (let ((.cse22 (+ (mod (+ (* .cse19 255) .cse21) 256) (- 256)))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse22))) (let ((.cse16 (mod .cse22 .cse17))) (and (= .cse6 (mod (+ .cse16 (* 255 .cse17)) 256)) (<= (mod (+ (* 255 .cse18) .cse19) 256) 127) (<= 128 .cse20) (not (= .cse19 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse17 0)) (not (= .cse21 0)) (= (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse16 0)) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse15) (and .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse32 .cse28) 256))) (let ((.cse31 (+ (- 256) .cse29))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse31))) (let ((.cse27 (mod .cse31 (mod .cse26 256)))) (let ((.cse30 (+ (mod (+ .cse27 (* 255 .cse26)) 256) (- 256)))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30))) (let ((.cse25 (mod .cse30 .cse24))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse6 (mod (+ (* .cse24 255) .cse25) 256)) (not (= .cse25 0)) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse27 0)) (<= 128 (mod (+ (* 255 .cse28) |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256)) (not (= .cse28 0)) (= (mod .cse24 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse29) (not (= .cse26 0)) (not (= .cse24 0))))))))))))) (and .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse38 (mod (+ .cse32 .cse37) 256))) (let ((.cse40 (+ (- 256) .cse38))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse40))) (let ((.cse36 (mod .cse40 (mod .cse35 256)))) (let ((.cse39 (+ (mod (+ .cse36 (* 255 .cse35)) 256) (- 256)))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39))) (let ((.cse34 (mod .cse39 .cse33))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= .cse6 (mod (+ (* .cse33 255) .cse34) 256)) (not (= .cse34 0)) (<= .cse35 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse36 0)) (not (= .cse37 0)) (= (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse38) (<= (mod (+ (* 255 .cse37) |c_ULTIMATE.start_main1_~y~0#1| .cse35) 256) 127) (not (= .cse35 0)) (not (= .cse33 0))))))))))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod (+ .cse32 .cse44) 256))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse45))) (let ((.cse42 (mod .cse45 (mod .cse43 256)))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= 0 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse41 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse42 .cse41)) (<= 128 (mod (+ .cse32 .cse43 .cse44) 256)) (not (= .cse44 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse45 127) (<= .cse43 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse49 (mod (+ .cse32 .cse47) 256))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (let ((.cse50 (mod .cse49 (mod .cse46 256)))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse32 .cse46 .cse47) 256) 127) (= 0 (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse49 0)) (not (= .cse48 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse50 .cse48)) (not (= .cse47 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse49 127) (not (= .cse46 0)) (<= .cse46 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse55 (mod .cse52 256))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse55))) (let ((.cse54 (mod .cse55 (mod .cse51 256)))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse54))) (and (<= (mod (+ .cse51 .cse52) 256) 127) (= (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse54 .cse53)) (<= .cse55 127) (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse53 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse51 0)) (<= 128 (mod (+ (* 255 .cse52) .cse51) 256))))))))) .cse5))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 15:48:29,827 WARN L286 SmtUtils]: Spent 1.14m on a formula simplification. DAG size of input: 160 DAG size of output: 149 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:48:56,653 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse3 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse30 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod .cse0 256))) (let ((.cse8 (+ (- 256) .cse2))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse8))) (let ((.cse6 (mod .cse8 (mod .cse1 256)))) (let ((.cse7 (+ (mod (+ (* .cse1 255) .cse6) 256) (- 256)))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse7))) (let ((.cse4 (mod .cse7 .cse5))) (and (<= (mod (+ (* 255 .cse0) .cse1) 256) 127) (<= 128 .cse2) (not (= .cse1 0)) (= .cse3 (mod (+ .cse4 (* 255 .cse5)) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse5 0)) (not (= .cse6 0)) (not (= .cse4 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse11 (mod .cse10 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse11))) (let ((.cse12 (mod .cse11 (mod .cse9 256)))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse12))) (and (<= (mod (+ .cse9 .cse10) 256) 127) (<= .cse11 127) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse12 .cse13)) (not (= .cse13 0)) (= (mod .cse13 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse9 0)) (<= 128 (mod (+ (* 255 .cse10) .cse9) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse16 (mod .cse14 256))) (let ((.cse21 (+ (- 256) .cse16))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse21))) (let ((.cse19 (mod .cse21 (mod .cse15 256)))) (let ((.cse20 (+ (mod (+ (* .cse15 255) .cse19) 256) (- 256)))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20))) (let ((.cse17 (mod .cse20 .cse18))) (and (<= 128 (mod (+ (* 255 .cse14) .cse15) 256)) (<= 128 .cse16) (not (= .cse15 0)) (= .cse3 (mod (+ .cse17 (* 255 .cse18)) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse18 0)) (not (= .cse19 0)) (not (= .cse17 0)) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse18 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse27 (mod (+ .cse30 .cse26) 256))) (let ((.cse29 (+ (- 256) .cse27))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse29))) (let ((.cse24 (mod .cse29 (mod .cse23 256)))) (let ((.cse28 (+ (mod (+ .cse24 (* 255 .cse23)) 256) (- 256)))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse28))) (let ((.cse22 (mod .cse28 .cse25))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse22 0)) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse24 0)) (= .cse3 (mod (+ (* .cse25 255) .cse22) 256)) (<= 128 (mod (+ (* 255 .cse26) |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)) (not (= .cse26 0)) (= (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse27) (not (= .cse23 0)) (not (= .cse25 0)))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse36 (mod (+ .cse30 .cse35) 256))) (let ((.cse38 (+ (- 256) .cse36))) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse38))) (let ((.cse33 (mod .cse38 (mod .cse32 256)))) (let ((.cse37 (+ (mod (+ .cse33 (* 255 .cse32)) 256) (- 256)))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse37))) (let ((.cse31 (mod .cse37 .cse34))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse31 0)) (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse33 0)) (= .cse3 (mod (+ (* .cse34 255) .cse31) 256)) (not (= .cse35 0)) (= (mod .cse34 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse36) (<= (mod (+ (* 255 .cse35) |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 127) (not (= .cse32 0)) (not (= .cse34 0)))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod .cse40 256))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse41))) (let ((.cse42 (mod .cse41 (mod .cse39 256)))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42))) (and (<= 128 (mod (+ .cse39 .cse40) 256)) (<= .cse41 127) (<= .cse39 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse42 .cse43)) (not (= .cse43 0)) (= (mod .cse43 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod (+ .cse30 .cse47) 256))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse48))) (let ((.cse44 (mod .cse48 (mod .cse46 256)))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse44))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse44 .cse45)) (not (= .cse45 0)) (<= 128 (mod (+ .cse30 .cse46 .cse47) 256)) (not (= .cse47 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse48 127) (= (mod .cse45 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= .cse46 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse53 (mod (+ .cse30 .cse50) 256))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse53))) (let ((.cse51 (mod .cse53 (mod .cse49 256)))) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse51))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (mod (+ .cse30 .cse49 .cse50) 256) 127) (= |c_ULTIMATE.start_main1_~g~0#1| (mod .cse51 .cse52)) (not (= .cse53 0)) (not (= .cse52 0)) (not (= .cse50 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse53 127) (not (= .cse49 0)) (= (mod .cse52 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= .cse49 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) is different from false [2024-11-13 15:49:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-13 15:49:28,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:50:52,164 WARN L286 SmtUtils]: Spent 38.32s on a formula simplification. DAG size of input: 79 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:51:45,224 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)