./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB --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 add45819e4621ede17512a8acbf89201f3f4db1ab1bf97afdd66c20e4064e4cd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:09:26,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:09:26,345 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:09:26,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:09:26,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:09:26,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:09:26,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:09:26,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:09:26,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:09:26,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:09:26,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:09:26,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:09:26,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:09:26,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:09:26,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:09:26,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:09:26,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:09:26,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:09:26,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:09:26,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:09:26,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:09:26,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:09:26,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:09:26,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:09:26,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:09:26,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:09:26,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:09:26,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:09:26,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:09:26,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:09:26,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:09:26,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:09:26,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:09:26,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:09:26,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:09:26,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:09:26,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:09:26,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:09:26,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:09:26,405 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_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB 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 -> add45819e4621ede17512a8acbf89201f3f4db1ab1bf97afdd66c20e4064e4cd [2024-11-28 02:09:26,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:09:26,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:09:26,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:09:26,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:09:26,718 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:09:26,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i [2024-11-28 02:09:29,620 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/data/edf5b254e/abc3e2c97e8044d9bf7edc5ae203d094/FLAGcbced5c77 [2024-11-28 02:09:29,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:09:29,882 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i [2024-11-28 02:09:29,893 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/data/edf5b254e/abc3e2c97e8044d9bf7edc5ae203d094/FLAGcbced5c77 [2024-11-28 02:09:29,906 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/data/edf5b254e/abc3e2c97e8044d9bf7edc5ae203d094 [2024-11-28 02:09:29,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:09:29,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:09:29,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:09:29,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:09:29,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:09:29,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:09:29" (1/1) ... [2024-11-28 02:09:29,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c93a5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:29, skipping insertion in model container [2024-11-28 02:09:29,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:09:29" (1/1) ... [2024-11-28 02:09:29,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:09:30,080 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_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[1226,1239] [2024-11-28 02:09:30,108 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_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[2841,2854] [2024-11-28 02:09:30,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:09:30,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:09:30,132 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_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[1226,1239] [2024-11-28 02:09:30,144 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_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[2841,2854] [2024-11-28 02:09:30,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:09:30,160 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:09:30,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30 WrapperNode [2024-11-28 02:09:30,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:09:30,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:09:30,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:09:30,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:09:30,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,211 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-28 02:09:30,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:09:30,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:09:30,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:09:30,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:09:30,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,251 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-28 02:09:30,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,262 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:09:30,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:09:30,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:09:30,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:09:30,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (1/1) ... [2024-11-28 02:09:30,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:09:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:30,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:09:30,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:09:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:09:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-28 02:09:30,347 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-28 02:09:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-28 02:09:30,347 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-28 02:09:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:09:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:09:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:09:30,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:09:30,415 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:09:30,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:09:30,668 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-28 02:09:30,668 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:09:30,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:09:30,679 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 02:09:30,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:09:30 BoogieIcfgContainer [2024-11-28 02:09:30,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:09:30,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:09:30,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:09:30,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:09:30,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:09:29" (1/3) ... [2024-11-28 02:09:30,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393b697b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:09:30, skipping insertion in model container [2024-11-28 02:09:30,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:09:30" (2/3) ... [2024-11-28 02:09:30,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393b697b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:09:30, skipping insertion in model container [2024-11-28 02:09:30,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:09:30" (3/3) ... [2024-11-28 02:09:30,690 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_4.i [2024-11-28 02:09:30,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:09:30,708 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_4.i that has 3 procedures, 38 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-28 02:09:30,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:09:30,773 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;@7aff3018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:09:30,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-28 02:09:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:09:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 02:09:30,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:30,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:30,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:30,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1679801867, now seen corresponding path program 1 times [2024-11-28 02:09:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070043369] [2024-11-28 02:09:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:31,100 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-28 02:09:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070043369] [2024-11-28 02:09:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070043369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:31,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:31,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:09:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857766535] [2024-11-28 02:09:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:31,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:31,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:31,130 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:31,234 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2024-11-28 02:09:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:09:31,236 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-28 02:09:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:31,242 INFO L225 Difference]: With dead ends: 75 [2024-11-28 02:09:31,242 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 02:09:31,246 INFO L434 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-28 02:09:31,253 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:31,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:09:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 02:09:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-28 02:09:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:09:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-28 02:09:31,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2024-11-28 02:09:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:31,290 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-28 02:09:31,291 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-28 02:09:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-28 02:09:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 02:09:31,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:31,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:09:31,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 95205495, now seen corresponding path program 1 times [2024-11-28 02:09:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419975589] [2024-11-28 02:09:31,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:31,482 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-28 02:09:31,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419975589] [2024-11-28 02:09:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419975589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:31,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:09:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406863401] [2024-11-28 02:09:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:31,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:31,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:31,488 INFO L87 Difference]: Start difference. First operand 30 states and 33 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-28 02:09:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:31,526 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-28 02:09:31,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:09:31,527 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-28 02:09:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:31,529 INFO L225 Difference]: With dead ends: 38 [2024-11-28 02:09:31,529 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 02:09:31,529 INFO L434 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-28 02:09:31,531 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:31,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:09:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 02:09:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-28 02:09:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:09:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-28 02:09:31,539 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2024-11-28 02:09:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:31,539 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-28 02:09:31,539 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-28 02:09:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-28 02:09:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 02:09:31,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:31,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:31,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:09:31,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1676333701, now seen corresponding path program 1 times [2024-11-28 02:09:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731536627] [2024-11-28 02:09:31,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:31,793 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-28 02:09:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731536627] [2024-11-28 02:09:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731536627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939196415] [2024-11-28 02:09:31,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:31,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:31,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:09:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:31,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 02:09:31,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:32,029 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-28 02:09:32,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:32,143 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-28 02:09:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939196415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:09:32,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:09:32,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-28 02:09:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177588802] [2024-11-28 02:09:32,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:09:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:32,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:09:32,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:09:32,149 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-28 02:09:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:32,268 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-28 02:09:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:09:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-28 02:09:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:32,270 INFO L225 Difference]: With dead ends: 40 [2024-11-28 02:09:32,271 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 02:09:32,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 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-28 02:09:32,272 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:32,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:09:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 02:09:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-28 02:09:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:09:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-28 02:09:32,279 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2024-11-28 02:09:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:32,279 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-28 02:09:32,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-28 02:09:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-28 02:09:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 02:09:32,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:32,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:32,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:09:32,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:32,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:32,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash 976515455, now seen corresponding path program 2 times [2024-11-28 02:09:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32052174] [2024-11-28 02:09:32,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:09:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:32,525 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:09:32,526 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:09:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32052174] [2024-11-28 02:09:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32052174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114828616] [2024-11-28 02:09:33,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:09:33,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:33,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:33,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:09:33,323 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:09:33,323 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:09:33,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 02:09:33,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:38,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114828616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:09:52,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:09:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-28 02:09:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274711175] [2024-11-28 02:09:52,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:52,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 02:09:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:52,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 02:09:52,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:09:52,040 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-28 02:09:56,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 02:09:59,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 02:10:03,715 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-28 02:10:07,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 02:10:10,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 02:10:14,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 02:10:15,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-28 02:10:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:17,024 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-28 02:10:17,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:17,025 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 15 [2024-11-28 02:10:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:17,025 INFO L225 Difference]: With dead ends: 47 [2024-11-28 02:10:17,025 INFO L226 Difference]: Without dead ends: 38 [2024-11-28 02:10:17,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:10:17,027 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:17,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 394 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 1 Unknown, 0 Unchecked, 20.5s Time] [2024-11-28 02:10:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-28 02:10:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-28 02:10:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 02:10:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-28 02:10:17,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 15 [2024-11-28 02:10:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:17,039 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-28 02:10:17,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-28 02:10:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-28 02:10:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 02:10:17,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:17,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:17,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:10:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:17,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:10:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 44590727, now seen corresponding path program 3 times [2024-11-28 02:10:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347698642] [2024-11-28 02:10:17,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:10:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:17,313 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 02:10:17,313 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:10:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:20,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347698642] [2024-11-28 02:10:20,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347698642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:20,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806956985] [2024-11-28 02:10:20,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:10:20,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:20,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:20,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad4e2534-7fae-4cb1-b5b7-b8a24030b8a2/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:10:20,909 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 02:10:20,909 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:10:20,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 02:10:20,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:11:36,511 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 66 DAG size of output: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:12:17,664 WARN L286 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 87 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:12:57,437 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:13:14,763 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:13:40,505 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 72 DAG size of output: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:13:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:13:47,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:14:55,357 WARN L286 SmtUtils]: Spent 33.70s on a formula simplification. DAG size of input: 83 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:16:06,367 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse19 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse28 (+ (- 256) .cse26))) (let ((.cse18 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse29 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28)) (.cse17 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (let ((.cse7 (< .cse29 .cse17)) (.cse8 (< 0 .cse18)) (.cse9 (not (= 0 (mod .cse28 (mod .cse29 256))))) (.cse25 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse27 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26))) (let ((.cse15 (< 127 .cse26)) (.cse12 (not (= (mod .cse26 (mod .cse27 256)) 0))) (.cse13 (< .cse27 .cse17)) (.cse14 (= .cse26 0)) (.cse1 (< .cse26 128)) (.cse3 (< .cse25 128)) (.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (< 127 .cse25)) (.cse4 (or .cse7 .cse8 .cse9)) (.cse0 (mod .cse19 256))) (and (or (< 127 .cse0) (let ((.cse6 (= .cse19 0))) (let ((.cse5 (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse0))) (or (< .cse16 .cse17) (and (<= .cse18 0) (not .cse6)) (not (= (mod .cse0 (mod .cse16 256)) 0)) (= .cse0 0))))) (and (or .cse1 (and (or .cse2 .cse3 (and .cse4 .cse5)) (or (and (or .cse6 .cse7 .cse8 .cse9) .cse5) .cse2 .cse10))) (or (let ((.cse11 (and (or .cse12 .cse6 .cse13 .cse14 .cse8) .cse5))) (and (or .cse11 .cse2 .cse10) (or .cse11 .cse2 .cse3))) .cse15))))) (or (< .cse0 128) (let ((.cse21 (let ((.cse24 (+ (- 256) .cse0))) (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse24))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse23 .cse17) (not (= (mod .cse24 (mod .cse23 256)) 0))))))) (and (or .cse15 (let ((.cse20 (and (or .cse12 .cse13 .cse14 .cse8) .cse21))) (and (or .cse20 .cse2 .cse10) (or .cse20 .cse2 .cse3)))) (or .cse1 (let ((.cse22 (and .cse21 .cse4))) (and (or .cse22 .cse2 .cse3) (or .cse22 .cse2 .cse10)))))))))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) is different from true [2024-11-28 02:16:51,052 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:16:56,214 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse18 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse18 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse22 (+ (- 256) .cse20))) (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22)) (.cse11 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (let ((.cse16 (< .cse23 .cse11)) (.cse4 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse17 (not (= 0 (mod .cse22 (mod .cse23 256))))) (.cse21 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20))) (let ((.cse0 (< 127 .cse20)) (.cse1 (not (= (mod .cse20 (mod .cse21 256)) 0))) (.cse2 (< .cse21 .cse11)) (.cse3 (= .cse20 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse8 (or .cse16 .cse4 .cse17)) (.cse7 (< .cse20 128)) (.cse9 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse13 (mod .cse18 256))) (and (or (let ((.cse5 (let ((.cse12 (+ (- 256) .cse13))) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12))) (or .cse9 (< .cse10 .cse11) (not (= (mod .cse12 (mod .cse10 256)) 0))))))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4) .cse5) .cse6) (or .cse7 (and .cse5 .cse8) .cse6))) (< .cse13 128)) (or (< 127 .cse13) (let ((.cse14 (= .cse18 0)) (.cse15 (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13))) (or (< .cse19 .cse11) .cse9 (not (= (mod .cse13 (mod .cse19 256)) 0)) (= .cse13 0))))) (and (or .cse0 (and (or .cse1 .cse14 .cse2 .cse3 .cse4) .cse15) .cse6) (or (and (or .cse6 (and (or .cse14 .cse16 .cse4 .cse17) .cse15)) (or .cse6 (and .cse8 .cse15) (< (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128))) .cse7))))))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) is different from true [2024-11-28 02:17:30,506 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:58,169 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:16,909 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:38,725 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:44,325 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:02,563 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:20,943 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:40,802 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:24:19,200 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse1 .cse7) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse4))) (let ((.cse6 (mod .cse5 256))) (let ((.cse2 (mod .cse4 .cse6))) (or (< (mod .cse1 256) 128) (< .cse2 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (< (mod (+ (* .cse1 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 128) (< 127 (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse6 (mod .cse2 256)) 0)) (= 0 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (mod (+ (* .cse9 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse12)) 256) (- 256)))) (let ((.cse11 (mod .cse12 .cse10))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse9 .cse7) 256)) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse11 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse13 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (mod .cse17 .cse15))) (or (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse13 255) .cse14) 256) 128) (not (= (mod .cse15 (mod .cse16 256)) 0)) (< 127 (mod (+ .cse13 .cse7) 256)) (< .cse16 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (= .cse14 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse18 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse21))) (let ((.cse19 (+ (mod (+ (* .cse18 255) .cse22) 256) (- 256)))) (let ((.cse20 (mod .cse21 .cse19))) (or (< (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse18 .cse7) 256)) (not (= (mod .cse19 (mod .cse20 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse21) (< .cse20 .cse3) (< (mod (+ .cse18 .cse22) 256) 128)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse23 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse27))) (let ((.cse25 (mod .cse24 256))) (let ((.cse26 (mod .cse27 .cse25))) (or (< (mod (+ (* .cse23 255) .cse24) 256) 128) (not (= (mod .cse25 (mod .cse26 256)) 0)) (< .cse26 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse27) (< 127 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse23 .cse7) 256) 128) (= .cse24 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse32))) (let ((.cse28 (+ (mod (+ (* .cse30 255) .cse7 .cse31) 256) (- 256)))) (let ((.cse29 (mod .cse32 .cse28))) (or (not (= (mod .cse28 (mod .cse29 256)) 0)) (< (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 128) (< 127 (mod .cse30 256)) (< 127 .cse32) (< (mod (+ .cse30 .cse7) 256) 128) (< .cse29 .cse3) (= .cse30 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod .cse36 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse35))) (let ((.cse33 (+ (mod (+ (* .cse36 255) .cse37) 256) (- 256)))) (let ((.cse34 (mod .cse35 .cse33))) (or (not (= (mod .cse33 (mod .cse34 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse35) (< 127 (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse36 .cse7) 256) 128) (< .cse34 .cse3) (< (mod (+ .cse36 .cse37) 256) 128)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse38 (+ (mod (+ (* .cse40 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41)) 256) (- 256)))) (let ((.cse39 (mod .cse41 .cse38))) (or (not (= (mod .cse38 (mod .cse39 256)) 0)) (< 127 (mod .cse40 256)) (< 127 .cse41) (< (mod (+ .cse40 .cse7) 256) 128) (< .cse39 .cse3) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse45) 256))) (let ((.cse42 (mod .cse45 .cse43))) (or (< .cse42 .cse3) (= .cse43 0) (< 127 (mod .cse44 256)) (< 127 .cse45) (not (= (mod .cse43 (mod .cse42 256)) 0)) (< (mod (+ .cse44 .cse7) 256) 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod .cse49 256))) (let ((.cse46 (+ (mod (+ (* .cse49 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse48)) 256) (- 256)))) (let ((.cse47 (mod .cse48 .cse46))) (or (not (= (mod .cse46 (mod .cse47 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse48) (< 127 (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse49 .cse7) 256) 128) (< .cse47 .cse3))))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53) 256))) (let ((.cse50 (mod .cse53 .cse51))) (or (< .cse50 .cse3) (= .cse51 0) (< (mod .cse52 256) 128) (< 127 (mod (+ .cse52 .cse7) 256)) (< 127 .cse53) (not (= (mod .cse51 (mod .cse50 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse55 (+ (mod (+ (* .cse54 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse57)) 256) (- 256)))) (let ((.cse56 (mod .cse57 .cse55))) (or (< (mod .cse54 256) 128) (not (= (mod .cse55 (mod .cse56 256)) 0)) (< 127 (mod (+ .cse54 .cse7) 256)) (< 127 .cse57) (< .cse56 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse62))) (let ((.cse59 (+ (mod (+ (* .cse58 255) .cse7 .cse61) 256) (- 256)))) (let ((.cse60 (mod .cse62 .cse59))) (or (< (mod .cse58 256) 128) (not (= (mod .cse59 (mod .cse60 256)) 0)) (< (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1| .cse61) 256) 128) (< 127 (mod (+ .cse58 .cse7) 256)) (< 127 .cse62) (< .cse60 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse63 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse67))) (let ((.cse64 (+ (mod (+ (* .cse63 255) .cse7 .cse66) 256) (- 256)))) (let ((.cse65 (mod .cse67 .cse64))) (or (< (mod .cse63 256) 128) (not (= (mod .cse64 (mod .cse65 256)) 0)) (< (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~b#1| .cse66) 256) 128) (< 127 .cse67) (< (mod (+ .cse63 .cse7) 256) 128) (< .cse65 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse69 (+ (mod (+ (* .cse68 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse71)) 256) (- 256)))) (let ((.cse70 (mod .cse71 .cse69))) (or (< (mod .cse68 256) 128) (not (= (mod .cse69 (mod .cse70 256)) 0)) (< 127 .cse71) (< (mod (+ .cse68 .cse7) 256) 128) (< .cse70 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse75 (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse73 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse75) 256))) (let ((.cse72 (mod .cse75 .cse73))) (or (< .cse72 .cse3) (= .cse73 0) (< (mod .cse74 256) 128) (< 127 .cse75) (not (= (mod .cse73 (mod .cse72 256)) 0)) (< (mod (+ .cse74 .cse7) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse76 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse76 256))) (let ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse80))) (let ((.cse78 (mod .cse77 256))) (let ((.cse79 (mod .cse80 .cse78))) (or (< (mod (+ .cse76 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse76 255) .cse77) 256) 128) (not (= (mod .cse78 (mod .cse79 256)) 0)) (< .cse79 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse80) (< (mod (+ .cse76 .cse7) 256) 128) (= .cse77 0))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod .cse81 256))) (let ((.cse82 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse85))) (let ((.cse83 (mod .cse82 256))) (let ((.cse84 (mod .cse85 .cse83))) (or (< (mod (+ (* .cse81 255) .cse82) 256) 128) (not (= (mod .cse83 (mod .cse84 256)) 0)) (< 127 (mod (+ .cse81 .cse7) 256)) (< .cse84 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse85) (< 127 (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse82 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse88 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse88 .cse7) 256))) (let ((.cse89 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87))) (let ((.cse90 (mod .cse89 256))) (let ((.cse86 (mod .cse87 .cse90))) (or (< .cse86 .cse3) (< 127 .cse87) (< 127 (mod .cse88 256)) (< (mod (+ (* .cse88 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse89) 256) 128) (< 127 (mod (+ .cse88 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse90 (mod .cse86 256)) 0)) (= 0 .cse89) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse94 (mod .cse91 256))) (let ((.cse92 (+ (mod (+ (* .cse91 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse94)) 256) (- 256)))) (let ((.cse93 (mod .cse94 .cse92))) (or (< (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse92 (mod .cse93 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse94) (< (mod (+ .cse91 .cse7) 256) 128) (< .cse93 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse95 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse99 (mod .cse95 256))) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse99))) (let ((.cse97 (mod .cse96 256))) (let ((.cse98 (mod .cse99 .cse97))) (or (< (mod (+ .cse95 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse95 255) .cse96) 256) 128) (not (= (mod .cse97 (mod .cse98 256)) 0)) (< .cse98 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse99) (< (mod (+ .cse95 .cse7) 256) 128) (= .cse96 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse100 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse103 (mod .cse100 256))) (let ((.cse104 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse103))) (let ((.cse101 (+ (mod (+ (* .cse100 255) .cse104) 256) (- 256)))) (let ((.cse102 (mod .cse103 .cse101))) (or (< (mod (+ .cse100 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse101 (mod .cse102 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse103) (< (mod (+ .cse100 .cse7) 256) 128) (< .cse102 .cse3) (< (mod (+ .cse100 .cse104) 256) 128))))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse105 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse109 (mod .cse105 256))) (let ((.cse106 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109))) (let ((.cse107 (mod .cse106 256))) (let ((.cse108 (mod .cse109 .cse107))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse105 255) .cse106) 256) 128) (not (= (mod .cse107 (mod .cse108 256)) 0)) (< .cse108 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse109) (< 127 (mod (+ .cse105 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse105 .cse7) 256) 128) (= .cse106 0))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse110 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod .cse110 256))) (let ((.cse111 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse114))) (let ((.cse112 (mod .cse111 256))) (let ((.cse113 (mod .cse114 .cse112))) (or (< (mod (+ .cse110 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse110 255) .cse111) 256) 128) (not (= (mod .cse112 (mod .cse113 256)) 0)) (< 127 (mod (+ .cse110 .cse7) 256)) (< .cse113 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse114) (= .cse111 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse116 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse117 (mod (+ .cse116 .cse7) 256))) (let ((.cse118 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse117))) (let ((.cse119 (mod .cse118 256))) (let ((.cse115 (mod .cse117 .cse119))) (or (< .cse115 .cse3) (< (mod (+ .cse116 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse117) (< 127 (mod .cse116 256)) (< (mod (+ (* .cse116 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse118) 256) 128) (not (= (mod .cse119 (mod .cse115 256)) 0)) (= 0 .cse118) (= .cse116 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse120 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse124 (mod .cse120 256))) (let ((.cse121 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse124))) (let ((.cse122 (mod .cse121 256))) (let ((.cse123 (mod .cse124 .cse122))) (or (< (mod (+ (* .cse120 255) .cse121) 256) 128) (not (= (mod .cse122 (mod .cse123 256)) 0)) (< 127 (mod (+ .cse120 .cse7) 256)) (< .cse123 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse124) (< 127 (mod (+ .cse120 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse121 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse127 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse128 (mod (+ .cse127 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse125 (+ (mod (+ (* .cse127 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse128)) 256) (- 256)))) (let ((.cse126 (mod .cse128 .cse125))) (or (not (= (mod .cse125 (mod .cse126 256)) 0)) (< 127 (mod (+ .cse127 .cse7) 256)) (< 127 (mod .cse127 256)) (< 127 .cse128) (< .cse126 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse131 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse133 (mod (+ .cse131 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse132 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse133))) (let ((.cse129 (+ (mod (+ (* .cse131 255) .cse7 .cse132) 256) (- 256)))) (let ((.cse130 (mod .cse133 .cse129))) (or (not (= (mod .cse129 (mod .cse130 256)) 0)) (< (mod (+ .cse131 |c_ULTIMATE.start_gcd_test_~b#1| .cse132) 256) 128) (< 127 (mod (+ .cse131 .cse7) 256)) (< 127 (mod .cse131 256)) (< 127 .cse133) (< .cse130 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse136 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse137 (mod (+ .cse136 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse135 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse137) 256))) (let ((.cse134 (mod .cse137 .cse135))) (or (< .cse134 .cse3) (= .cse135 0) (< 127 (mod (+ .cse136 .cse7) 256)) (< 127 (mod .cse136 256)) (< 127 .cse137) (not (= (mod .cse135 (mod .cse134 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse138 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse141 (mod .cse138 256))) (let ((.cse142 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse141))) (let ((.cse139 (+ (mod (+ (* .cse138 255) .cse142) 256) (- 256)))) (let ((.cse140 (mod .cse141 .cse139))) (or (< 127 (mod (+ .cse138 .cse7) 256)) (not (= (mod .cse139 (mod .cse140 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse141) (< 127 (mod (+ .cse138 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse140 .cse3) (< (mod (+ .cse138 .cse142) 256) 128)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse143 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse146 (mod .cse143 256))) (let ((.cse144 (+ (mod (+ (* .cse143 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse146)) 256) (- 256)))) (let ((.cse145 (mod .cse146 .cse144))) (or (< 127 (mod (+ .cse143 .cse7) 256)) (not (= (mod .cse144 (mod .cse145 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse146) (< 127 (mod (+ .cse143 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse145 .cse3)))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse147 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse149 (mod (+ .cse147 .cse7) 256))) (let ((.cse150 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse149))) (let ((.cse151 (mod .cse150 256))) (let ((.cse148 (mod .cse149 .cse151))) (or (< (mod .cse147 256) 128) (< .cse148 .cse3) (< (mod (+ .cse147 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse149) (< (mod (+ (* .cse147 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse150) 256) 128) (not (= (mod .cse151 (mod .cse148 256)) 0)) (= 0 .cse150) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) is different from true