./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_4.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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/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 e8259989f7570bf558987b7e4c2e7f61d77e5fd2d99fcc8a9ebe16670ccb62e9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:55:16,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:55:17,015 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:55:17,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:55:17,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:55:17,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:55:17,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:55:17,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:55:17,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:55:17,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:55:17,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:55:17,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:55:17,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:55:17,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:55:17,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:55:17,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:55:17,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:55:17,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:55:17,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:55:17,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:55:17,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:55:17,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:55:17,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:55:17,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:55:17,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:55:17,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:55:17,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:55:17,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:55:17,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:55:17,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:55:17,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:55:17,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:55:17,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:55:17,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:55:17,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:55:17,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:55:17,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:55:17,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:55:17,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:55:17,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:55:17,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:55:17,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:55:17,051 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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/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 -> e8259989f7570bf558987b7e4c2e7f61d77e5fd2d99fcc8a9ebe16670ccb62e9 [2024-11-13 14:55:17,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:55:17,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:55:17,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:55:17,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:55:17,375 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:55:17,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_2+newton_3_4.i Unable to find full path for "g++" [2024-11-13 14:55:19,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:55:19,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:55:19,585 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/sv-benchmarks/c/combinations/gcd_2+newton_3_4.i [2024-11-13 14:55:19,596 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/data/d98a34c51/99481b4359e84500b9e1eafab486c48a/FLAGbbb89d58b [2024-11-13 14:55:19,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/data/d98a34c51/99481b4359e84500b9e1eafab486c48a [2024-11-13 14:55:19,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:55:19,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:55:19,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:55:19,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:55:19,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:55:19,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:55:19" (1/1) ... [2024-11-13 14:55:19,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573f63b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:19, skipping insertion in model container [2024-11-13 14:55:19,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:55:19" (1/1) ... [2024-11-13 14:55:19,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:55:20,072 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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/sv-benchmarks/c/combinations/gcd_2+newton_3_4.i[1226,1239] [2024-11-13 14:55:20,105 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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/sv-benchmarks/c/combinations/gcd_2+newton_3_4.i[2862,2875] [2024-11-13 14:55:20,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:55:20,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:55:20,129 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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/sv-benchmarks/c/combinations/gcd_2+newton_3_4.i[1226,1239] [2024-11-13 14:55:20,141 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_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/sv-benchmarks/c/combinations/gcd_2+newton_3_4.i[2862,2875] [2024-11-13 14:55:20,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:55:20,159 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:55:20,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20 WrapperNode [2024-11-13 14:55:20,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:55:20,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:55:20,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:55:20,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:55:20,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,198 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2024-11-13 14:55:20,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:55:20,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:55:20,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:55:20,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:55:20,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,240 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 14:55:20,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:55:20,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:55:20,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:55:20,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:55:20,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (1/1) ... [2024-11-13 14:55:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:55:20,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:55:20,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:55:20,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:55:20,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:55:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 14:55:20,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 14:55:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 14:55:20,358 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 14:55:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:55:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:55:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:55:20,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:55:20,430 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:55:20,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:55:20,624 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-13 14:55:20,624 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:55:20,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:55:20,635 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:55:20,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:55:20 BoogieIcfgContainer [2024-11-13 14:55:20,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:55:20,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:55:20,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:55:20,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:55:20,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:55:19" (1/3) ... [2024-11-13 14:55:20,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b7e7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:55:20, skipping insertion in model container [2024-11-13 14:55:20,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:55:20" (2/3) ... [2024-11-13 14:55:20,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b7e7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:55:20, skipping insertion in model container [2024-11-13 14:55:20,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:55:20" (3/3) ... [2024-11-13 14:55:20,646 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_4.i [2024-11-13 14:55:20,662 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:55:20,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_3_4.i that has 3 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 14:55:20,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:55:20,734 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;@2846366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:55:20,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 14:55:20,739 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 14:55:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:55:20,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:55:20,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:55:20,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:55:20,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:55:20,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 14:55:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:55:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060717318] [2024-11-13 14:55:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:55:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:21,213 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 14:55:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:55:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060717318] [2024-11-13 14:55:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060717318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:55:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:55:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:55:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665725272] [2024-11-13 14:55:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:55:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:55:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:55:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:55:21,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:55:21,251 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 14:55:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:55:21,342 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-13 14:55:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:55:21,348 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 14:55:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:55:21,354 INFO L225 Difference]: With dead ends: 78 [2024-11-13 14:55:21,354 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 14:55:21,357 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 14:55:21,362 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 14:55:21,363 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 14:55:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 14:55:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-13 14:55:21,398 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 14:55:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-13 14:55:21,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-13 14:55:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:55:21,403 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-13 14:55:21,403 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 14:55:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-13 14:55:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:55:21,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:55:21,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:55:21,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:55:21,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:55:21,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:55:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 36038583, now seen corresponding path program 1 times [2024-11-13 14:55:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:55:21,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672897780] [2024-11-13 14:55:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:55:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:21,500 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 14:55:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:55:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672897780] [2024-11-13 14:55:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672897780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:55:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:55:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:55:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546087603] [2024-11-13 14:55:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:55:21,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:55:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:55:21,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:55:21,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:55:21,503 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 14:55:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:55:21,533 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-13 14:55:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:55:21,534 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 14:55:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:55:21,535 INFO L225 Difference]: With dead ends: 39 [2024-11-13 14:55:21,535 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 14:55:21,535 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 14:55:21,536 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 14:55:21,536 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 14:55:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 14:55:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 14:55:21,545 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 14:55:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-13 14:55:21,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-13 14:55:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:55:21,549 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-13 14:55:21,549 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 14:55:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-13 14:55:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 14:55:21,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:55:21,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:55:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:55:21,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:55:21,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:55:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1576478087, now seen corresponding path program 1 times [2024-11-13 14:55:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:55:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804284913] [2024-11-13 14:55:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:21,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:55:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:21,864 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 14:55:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:55:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804284913] [2024-11-13 14:55:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804284913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:55:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862326464] [2024-11-13 14:55:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:21,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:55:21,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:55:21,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:55:21,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:55:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:21,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:55:21,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:55:22,092 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 14:55:22,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:55:22,223 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 14:55:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862326464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:55:22,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:55:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-13 14:55:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431379390] [2024-11-13 14:55:22,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:55:22,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:55:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:55:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:55:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:55:22,225 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 14:55:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:55:22,364 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-13 14:55:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:55:22,365 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 14:55:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:55:22,365 INFO L225 Difference]: With dead ends: 40 [2024-11-13 14:55:22,366 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 14:55:22,366 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 14:55:22,367 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:55:22,367 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.1s Time] [2024-11-13 14:55:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 14:55:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 14:55:22,371 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 14:55:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-13 14:55:22,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2024-11-13 14:55:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:55:22,373 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-13 14:55:22,373 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 14:55:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-13 14:55:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 14:55:22,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:55:22,373 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:55:22,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:55:22,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:55:22,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:55:22,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:55:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash -24887305, now seen corresponding path program 2 times [2024-11-13 14:55:22,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:55:22,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569432131] [2024-11-13 14:55:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:55:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:23,229 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 14:55:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:55:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569432131] [2024-11-13 14:55:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569432131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:55:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116763725] [2024-11-13 14:55:23,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:55:23,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:55:23,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:55:23,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:55:23,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:55:23,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:55:23,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:55:23,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 14:55:23,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:56:38,824 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 14:56:38,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:57:18,842 WARN L286 SmtUtils]: Spent 7.60s 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 14:57:38,105 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 14:57:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116763725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:57:38,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:57:38,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-13 14:57:38,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369785634] [2024-11-13 14:57:38,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:57:38,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 14:57:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:38,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 14:57:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=444, Unknown=15, NotChecked=0, Total=552 [2024-11-13 14:57:38,110 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 14:57:42,263 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 14:57:46,490 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 14:57:50,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 14:57:56,098 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 14:58:00,223 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 14:58:04,424 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 14:58:09,420 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 14:58:13,737 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] [2024-11-13 14:58:18,067 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 14:58:30,139 WARN L286 SmtUtils]: Spent 6.62s 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 14:58:34,884 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 [1] [2024-11-13 14:58:38,984 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 [1] [2024-11-13 14:58:44,420 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, 1] [2024-11-13 14:58:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:58:45,976 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-13 14:58:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:58:45,977 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 14:58:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:58:45,978 INFO L225 Difference]: With dead ends: 50 [2024-11-13 14:58:45,978 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 14:58:45,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 113.5s TimeCoverageRelationStatistics Valid=121, Invalid=565, Unknown=16, NotChecked=0, Total=702 [2024-11-13 14:58:45,979 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:58:45,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 14 Unknown, 0 Unchecked, 54.4s Time] [2024-11-13 14:58:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 14:58:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 14:58:45,990 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 14:58:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-13 14:58:45,992 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2024-11-13 14:58:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:58:45,992 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-13 14:58:45,992 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 14:58:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-13 14:58:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 14:58:45,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:58:45,993 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:58:46,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:58:46,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:58:46,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:58:46,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:58:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash -710557577, now seen corresponding path program 3 times [2024-11-13 14:58:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:58:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928562362] [2024-11-13 14:58:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:58:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:58:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:58:53,500 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 14:58:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:58:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928562362] [2024-11-13 14:58:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928562362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:58:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254303685] [2024-11-13 14:58:53,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:58:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:58:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:58:53,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:58:53,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b8e54a1-de39-4e5a-bd43-a54c43cf5608/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:58:53,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 14:58:53,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:58:53,730 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 14:58:53,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:59:39,229 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 116 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:00:37,440 WARN L286 SmtUtils]: Spent 21.78s on a formula simplification. DAG size of input: 141 DAG size of output: 141 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:01:24,444 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (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 ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (mod .cse4 256))) (let ((.cse6 (+ (- 256) .cse5))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse6))) (let ((.cse3 (mod .cse6 .cse2))) (and (= .cse1 (mod (+ (* .cse2 255) .cse3) 256)) (<= (mod (+ (* 255 .cse4) .cse2) 256) 127) (<= 128 .cse5) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse3 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) (<= .cse2 |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 ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse7))) (and (<= .cse7 127) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse8 .cse7)) (<= |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) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse7 .cse8)))))) .cse0) (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 ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod (+ .cse12 .cse11) 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse10))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (+ .cse9 .cse10) 127) (not (= .cse11 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) (not (= .cse9 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse10 .cse9)) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse13 (mod (+ .cse12 .cse14) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse13 0)) (not (= .cse14 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse13))) (and (<= |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|) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse13 .cse15)) (<= 128 (+ .cse15 .cse13))))) (<= .cse13 127))))) (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 ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse18 (mod (+ .cse12 .cse17) 256))) (let ((.cse20 (+ (- 256) .cse18))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse20))) (let ((.cse19 (mod .cse20 .cse16))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse16 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse17) |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256)) (not (= .cse17 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 .cse18) (not (= .cse19 0)) (= .cse1 (mod (+ .cse19 (* 255 .cse16)) 256)) (not (= .cse16 0)))))))))) (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 ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse22))) (and (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse21 .cse22) 127) (<= 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 (= .cse21 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse22 .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 ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse24 (mod (+ .cse12 .cse23) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse23 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) (<= .cse24 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse24 .cse25)) (<= 128 (+ .cse25 .cse24)) (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse0) (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 ((.cse28 (mod (+ .cse12 .cse27) 256))) (let ((.cse30 (+ (- 256) .cse28))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse30))) (let ((.cse29 (mod .cse30 .cse26))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse27 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 .cse28) (not (= .cse29 0)) (<= (mod (+ (* 255 .cse27) |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256) 127) (= .cse1 (mod (+ .cse29 (* 255 .cse26)) 256)) (not (= .cse26 0))))))))) .cse0) (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 ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse34 (mod .cse33 256))) (let ((.cse35 (+ (- 256) .cse34))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse35))) (let ((.cse32 (mod .cse35 .cse31))) (and (= .cse1 (mod (+ (* .cse31 255) .cse32) 256)) (<= 128 (mod (+ (* 255 .cse33) .cse31) 256)) (<= 128 .cse34) (not (= .cse31 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse32 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) (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse36 (mod (+ .cse12 .cse37) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse36 0)) (not (= .cse37 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse36))) (and (<= (+ .cse38 .cse36) 127) (<= |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|) (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse38 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse36 .cse38))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse39 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (<= .cse39 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse39 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse39))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse40 |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|))) (<= 128 (+ .cse40 .cse39)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse39 .cse40)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod (+ .cse12 .cse41) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse44 (+ (- 256) .cse45))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse44))) (let ((.cse43 (mod .cse44 .cse42))) (and (<= 128 (mod (+ (* 255 .cse41) |c_ULTIMATE.start_main1_~y~0#1| .cse42) 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 (<= .cse42 |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 (= .cse43 0)) (= .cse1 (mod (+ .cse43 (* 255 .cse42)) 256)) (not (= .cse42 0))))))) (not (= .cse41 0)) (<= 128 .cse45))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (mod (+ .cse12 .cse48) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse49 (+ (- 256) .cse50))) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (let ((.cse47 (mod .cse49 .cse46))) (and (<= |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 (<= .cse46 |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 (= .cse47 0)) (<= (mod (+ (* 255 .cse48) |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256) 127) (= .cse1 (mod (+ .cse47 (* 255 .cse46)) 256)) (not (= .cse46 0))))))) (not (= .cse48 0)) (<= 128 .cse50))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse52 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse52))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse51 |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|))) (<= (+ .cse51 .cse52) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse51 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse52 .cse51))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse52 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse57 (mod .cse55 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse56 (+ (- 256) .cse57))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse56))) (let ((.cse54 (mod .cse56 .cse53))) (and (= .cse1 (mod (+ (* .cse53 255) .cse54) 256)) (<= (mod (+ (* 255 .cse55) .cse53) 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|) (<= .cse53 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse53 0)) (not (= .cse54 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))) (<= 128 .cse57) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse62 (mod .cse60 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse61 (+ (- 256) .cse62))) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse61))) (let ((.cse59 (mod .cse61 .cse58))) (and (= .cse1 (mod (+ (* .cse58 255) .cse59) 256)) (<= 128 (mod (+ (* 255 .cse60) .cse58) 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|) (<= .cse58 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse58 0)) (not (= .cse59 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))) (<= 128 .cse62) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 15:02:35,733 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse12 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse18 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (<= (mod |c_ULTIMATE.start_gcd_test_~a#1| 256) 127)) (.cse8 (<= 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 ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse3 (mod .cse1 256))) (let ((.cse6 (+ (- 256) .cse3))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse6))) (let ((.cse4 (mod .cse6 .cse2))) (let ((.cse5 (+ (- 256) (mod (+ (* .cse2 255) .cse4) 256)))) (and (<= 128 (mod (+ (* 255 .cse1) .cse2) 256)) (<= 128 .cse3) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse4 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse7) (and .cse8 (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 ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (mod (+ .cse18 .cse11) 256))) (let ((.cse17 (+ (- 256) .cse14))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse15 (mod .cse17 .cse9))) (let ((.cse16 (+ (- 256) (mod (+ .cse15 (* 255 .cse9)) 256)))) (let ((.cse10 (mod .cse16 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse10 0)) (<= 128 (mod (+ (* 255 .cse11) |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256)) (= (mod (+ .cse12 .cse10) 256) .cse13) (not (= .cse11 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse14) (not (= .cse15 0)) (not (= .cse9 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse16) |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) (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 ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (mod (+ .cse18 .cse20) 256))) (let ((.cse24 (+ (- 256) .cse21))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (let ((.cse22 (mod .cse24 .cse19))) (let ((.cse23 (+ (- 256) (mod (+ .cse22 (* 255 .cse19)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse20) |c_ULTIMATE.start_main1_~y~0#1| .cse19) 256)) (not (= .cse20 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse21) (not (= .cse22 0)) (not (= .cse19 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))))) .cse0 .cse7) (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 ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse27 (mod .cse26 .cse25))) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse25 .cse26) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse25 0)) (not (= .cse27 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27))))))) .cse0 .cse7) (and .cse8 (or (and .cse0 .cse7 (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 ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse30 (mod (+ .cse18 .cse31) 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse30))) (let ((.cse28 (mod .cse30 .cse29))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse28)) (not (= .cse28 0)) (<= (+ .cse29 .cse30) 127) (not (= .cse31 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse28 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse29 0)) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (mod (+ .cse18 .cse33) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse32 0)) (not (= .cse33 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse34 (mod .cse32 .cse35))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34)) (not (= .cse34 0)) (<= (+ .cse35 .cse32) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse35 0)) (<= .cse35 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|)))))))))))) (and .cse8 (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 ((.cse38 (mod .cse36 256))) (let ((.cse42 (+ (- 256) .cse38))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse42))) (let ((.cse40 (mod .cse42 .cse37))) (let ((.cse41 (+ (- 256) (mod (+ (* .cse37 255) .cse40) 256)))) (let ((.cse39 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ (* 255 .cse36) .cse37) 256) 127) (<= 128 .cse38) (not (= .cse37 0)) (not (= .cse39 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse40 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse41) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ .cse39 .cse12) 256) .cse13))))))))))) (and .cse8 (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 ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod .cse43 256))) (let ((.cse49 (+ (- 256) .cse45))) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (let ((.cse47 (mod .cse49 .cse44))) (let ((.cse48 (+ (- 256) (mod (+ (* .cse44 255) .cse47) 256)))) (let ((.cse46 (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ (* 255 .cse43) .cse44) 256)) (<= 128 .cse45) (not (= .cse44 0)) (not (= .cse46 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse47 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse48) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse44 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ .cse46 .cse12) 256) .cse13))))))))))) (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 ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse50))) (let ((.cse52 (mod .cse50 .cse51))) (and (<= .cse50 127) (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse51 .cse50)) (= (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse52 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))))))) .cse0 .cse7) (and .cse8 (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 ((.cse55 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse55))) (let ((.cse53 (mod .cse55 .cse54))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= .cse54 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse54 .cse55) 127) (<= 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 (= .cse54 0)) (not (= .cse53 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53)))))))) (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 ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse58 (mod (+ .cse18 .cse57) 256))) (let ((.cse61 (+ (- 256) .cse58))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse61))) (let ((.cse59 (mod .cse61 .cse56))) (let ((.cse60 (+ (- 256) (mod (+ .cse59 (* 255 .cse56)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse56 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse57 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse58) (not (= .cse59 0)) (<= (mod (+ (* 255 .cse57) |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256) 127) (not (= .cse56 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse60) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))))) .cse7) (and .cse8 (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 ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse65 (mod (+ .cse18 .cse64) 256))) (let ((.cse68 (+ (- 256) .cse65))) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse68))) (let ((.cse66 (mod .cse68 .cse62))) (let ((.cse67 (+ (- 256) (mod (+ .cse66 (* 255 .cse62)) 256)))) (let ((.cse63 (mod .cse67 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse62 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse63 0)) (= (mod (+ .cse12 .cse63) 256) .cse13) (not (= .cse64 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse65) (not (= .cse66 0)) (<= (mod (+ (* 255 .cse64) |c_ULTIMATE.start_main1_~y~0#1| .cse62) 256) 127) (not (= .cse62 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse67) |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) (and .cse8 (or (and .cse0 .cse7 (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 ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse71 (mod (+ .cse18 .cse70) 256))) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse71))) (let ((.cse69 (mod .cse71 .cse72))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse69)) (not (= .cse69 0)) (not (= .cse70 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse69 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse71 127) (<= 128 (+ .cse72 .cse71)) (<= .cse72 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse73 (mod (+ .cse18 .cse76) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse73 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse73))) (let ((.cse74 (mod .cse73 .cse75))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse74)) (not (= .cse74 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (+ .cse75 .cse73)) (<= .cse75 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse74 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (not (= .cse76 0)) (<= .cse73 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 ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse79 (mod .cse77 256))) (let ((.cse82 (+ (- 256) .cse79))) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse82))) (let ((.cse80 (mod .cse82 .cse78))) (let ((.cse81 (+ (- 256) (mod (+ (* .cse78 255) .cse80) 256)))) (and (<= (mod (+ (* 255 .cse77) .cse78) 256) 127) (<= 128 .cse79) (not (= .cse78 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse80 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse81) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse81 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse78 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse0 .cse7) (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 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse84))) (let ((.cse83 (mod .cse84 .cse85))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse83 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= .cse84 127) (<= .cse85 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse85 .cse84)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse83 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse83))))))) .cse8)))) is different from false [2024-11-13 15:03:34,087 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse0 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse19 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse18 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (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 ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse6 (mod .cse4 256))) (let ((.cse9 (+ (- 256) .cse6))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse9))) (let ((.cse7 (mod .cse9 .cse5))) (let ((.cse8 (+ (- 256) (mod (+ (* .cse5 255) .cse7) 256)))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse8))) (let ((.cse3 (mod .cse8 .cse2))) (and (= .cse1 (mod (+ (* .cse2 255) .cse3) 256)) (<= (mod (+ (* 255 .cse4) .cse5) 256) 127) (<= 128 .cse6) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse7 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse2 0)) (not (= .cse3 0)) (<= .cse5 |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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (mod (+ .cse18 .cse12) 256))) (let ((.cse17 (+ (- 256) .cse14))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse15 (mod .cse17 .cse11))) (let ((.cse16 (+ (- 256) (mod (+ .cse15 (* 255 .cse11)) 256)))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse16))) (let ((.cse10 (mod .cse16 .cse13))) (and (not (= .cse10 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse12) |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256)) (not (= .cse12 0)) (= .cse1 (mod (+ (* .cse13 255) .cse10) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse13 0)) (<= 128 .cse14) (not (= .cse15 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse11 0)))))))))))) .cse0) (and .cse19 (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 ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse23 (mod (+ .cse18 .cse21) 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse23))) (let ((.cse22 (mod .cse23 .cse24))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse22))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse22 .cse20) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse23 127) (not (= .cse20 0)) (<= 128 (+ .cse24 .cse23)) (<= .cse24 |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 ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse18 .cse27) 256))) (let ((.cse32 (+ (- 256) .cse29))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse30 (mod .cse32 .cse26))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 (* 255 .cse26)) 256)))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31))) (let ((.cse25 (mod .cse31 .cse28))) (and (not (= .cse25 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse27 0)) (= .cse1 (mod (+ (* .cse28 255) .cse25) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse28 0)) (<= 128 .cse29) (not (= .cse30 0)) (<= (mod (+ (* 255 .cse27) |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse26 0)))))))))))) .cse0) (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 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse36))) (let ((.cse34 (mod .cse36 .cse35))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34))) (and (not (= .cse33 0)) (= (mod .cse34 .cse33) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse35 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse35 .cse36) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse33 |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 (= .cse35 0)))))))) .cse19) (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 ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod .cse39 256))) (let ((.cse44 (+ (- 256) .cse41))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse44))) (let ((.cse42 (mod .cse44 .cse40))) (let ((.cse43 (+ (- 256) (mod (+ (* .cse40 255) .cse42) 256)))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse43))) (let ((.cse38 (mod .cse43 .cse37))) (and (= .cse1 (mod (+ (* .cse37 255) .cse38) 256)) (<= 128 (mod (+ (* 255 .cse39) .cse40) 256)) (<= 128 .cse41) (not (= .cse40 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse42 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse37 0)) (not (= .cse38 0)) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse0) (and .cse19 (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 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse47))) (let ((.cse46 (mod .cse47 .cse48))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse46))) (and (not (= .cse45 0)) (= (mod .cse46 .cse45) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse47 127) (<= .cse48 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse48 .cse47)) (= (mod .cse45 |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 .cse19 (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 ((.cse51 (mod (+ .cse18 .cse52) 256))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse53 (mod .cse51 .cse50))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ .cse50 .cse51) 127) (not (= .cse52 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse53 .cse49) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse50 0)) (not (= .cse49 0)) (<= .cse50 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 15:06:05,631 WARN L286 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 149 DAG size of output: 138 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:08:15,494 WARN L286 SmtUtils]: Spent 42.08s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:08:40,764 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 ((.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse9 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (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 ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod (+ .cse5 .cse1) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse2))) (let ((.cse3 (mod .cse2 .cse4))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse0 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse1 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse2 127) (= (mod .cse3 .cse0) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse0 0)) (<= 128 (+ .cse4 .cse2)) (<= .cse4 |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 ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse8 (mod .cse6 256))) (let ((.cse14 (+ (- 256) .cse8))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse14))) (let ((.cse12 (mod .cse14 .cse7))) (let ((.cse13 (+ (- 256) (mod (+ (* .cse7 255) .cse12) 256)))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse13))) (let ((.cse11 (mod .cse13 .cse10))) (and (<= (mod (+ (* 255 .cse6) .cse7) 256) 127) (<= 128 .cse8) (not (= .cse7 0)) (= .cse9 (mod (+ (* .cse10 255) .cse11) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse12 0)) (= (mod .cse10 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse10 0)) (not (= .cse11 0)) (<= .cse7 |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 ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod (+ .cse5 .cse18) 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse19 (mod .cse17 .cse16))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= (+ .cse16 .cse17) 127) (not (= .cse18 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse16 0)) (= (mod .cse19 .cse15) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse15 0)) (<= .cse16 |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 ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse21))) (let ((.cse23 (mod .cse21 .cse22))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23))) (and (not (= .cse20 0)) (<= .cse21 127) (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse23 .cse20) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse22 .cse21)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse20 |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 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse27 (mod .cse26 .cse25))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27))) (and (not (= .cse24 0)) (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse25 .cse26) 127) (= (mod .cse27 .cse24) |c_ULTIMATE.start_main1_~g~0#1|) (<= 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 (= .cse25 0)) (= (mod .cse24 |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 ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (mod (+ .cse5 .cse31) 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse35))) (let ((.cse33 (mod .cse35 .cse30))) (let ((.cse34 (+ (- 256) (mod (+ .cse33 (* 255 .cse30)) 256)))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34))) (let ((.cse29 (mod .cse34 .cse28))) (and (= (mod .cse28 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse29 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse30 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ (* .cse28 255) .cse29) 256) .cse9) (not (= .cse31 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse28 0)) (<= 128 .cse32) (not (= .cse33 0)) (<= (mod (+ (* 255 .cse31) |c_ULTIMATE.start_main1_~y~0#1| .cse30) 256) 127) (not (= .cse30 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 ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod (+ .cse5 .cse39) 256))) (let ((.cse43 (+ (- 256) .cse40))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse43))) (let ((.cse41 (mod .cse43 .cse38))) (let ((.cse42 (+ (- 256) (mod (+ .cse41 (* 255 .cse38)) 256)))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42))) (let ((.cse37 (mod .cse42 .cse36))) (and (= (mod .cse36 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse37 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ (* .cse36 255) .cse37) 256) .cse9) (<= 128 (mod (+ (* 255 .cse39) |c_ULTIMATE.start_main1_~y~0#1| .cse38) 256)) (not (= .cse39 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse36 0)) (<= 128 .cse40) (not (= .cse41 0)) (not (= .cse38 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 ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (mod .cse44 256))) (let ((.cse51 (+ (- 256) .cse46))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse49 (mod .cse51 .cse45))) (let ((.cse50 (+ (- 256) (mod (+ (* .cse45 255) .cse49) 256)))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50))) (let ((.cse48 (mod .cse50 .cse47))) (and (<= 128 (mod (+ (* 255 .cse44) .cse45) 256)) (<= 128 .cse46) (not (= .cse45 0)) (= .cse9 (mod (+ (* .cse47 255) .cse48) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse49 0)) (= (mod .cse47 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse47 0)) (not (= .cse48 0)) (<= .cse45 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))))))) is different from false [2024-11-13 15:09:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2024-11-13 15:09:18,331 INFO L311 TraceCheckSpWp]: Computing backward predicates...