./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme --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 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:45,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:45,496 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:50:45,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:45,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:45,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:45,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:45,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:45,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:45,535 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:45,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:50:45,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:50:45,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:45,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:45,538 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:45,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:45,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:50:45,540 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:50:45,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:45,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:50:45,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:45,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:50:45,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:50:45,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:50:45,544 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:50:45,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:50:45,545 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:45,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:45,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:45,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:50:45,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:50:45,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:45,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:45,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:50:45,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:50:45,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:50:45,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:50:45,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:50:45,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:50:45,551 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:50:45,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:50:45,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:50:45,552 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme 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 -> 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d [2023-11-26 11:50:45,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:45,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:45,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:45,837 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:45,838 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:45,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2023-11-26 11:50:49,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:49,518 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:49,518 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2023-11-26 11:50:49,532 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/data/db1696e52/baf52221b4044298ba7b7c66a4c73f7f/FLAG714c988f8 [2023-11-26 11:50:49,551 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/data/db1696e52/baf52221b4044298ba7b7c66a4c73f7f [2023-11-26 11:50:49,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:49,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:49,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:49,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:49,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:49,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8f5e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49, skipping insertion in model container [2023-11-26 11:50:49,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,591 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:49,735 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2023-11-26 11:50:49,764 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2023-11-26 11:50:49,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:49,777 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:49,792 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2023-11-26 11:50:49,805 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2023-11-26 11:50:49,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:49,822 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:49,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49 WrapperNode [2023-11-26 11:50:49,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:49,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:49,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:49,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:49,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,865 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-26 11:50:49,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:49,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:49,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:49,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:49,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,895 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-26 11:50:49,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:49,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:49,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:49,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:49,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (1/1) ... [2023-11-26 11:50:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:49,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:49,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:49,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:50:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-26 11:50:50,010 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-26 11:50:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-26 11:50:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-26 11:50:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:50:50,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:50:50,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:50,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:50,124 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:50,126 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:50,379 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:50,410 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:50,410 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:50:50,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:50 BoogieIcfgContainer [2023-11-26 11:50:50,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:50,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:50:50,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:50:50,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:50:50,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:50:49" (1/3) ... [2023-11-26 11:50:50,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770ce35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:50, skipping insertion in model container [2023-11-26 11:50:50,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:49" (2/3) ... [2023-11-26 11:50:50,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770ce35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:50, skipping insertion in model container [2023-11-26 11:50:50,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:50" (3/3) ... [2023-11-26 11:50:50,421 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_6.i [2023-11-26 11:50:50,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:50:50,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 11:50:50,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:50:50,492 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ef69941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:50:50,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-26 11:50:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:50:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-26 11:50:50,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:50,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:50,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:50,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-11-26 11:50:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:50,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78371441] [2023-11-26 11:50:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:50,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78371441] [2023-11-26 11:50:50,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78371441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:50,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:50,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566119790] [2023-11-26 11:50:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:50,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:50,942 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:51,096 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-11-26 11:50:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-26 11:50:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:51,106 INFO L225 Difference]: With dead ends: 61 [2023-11-26 11:50:51,107 INFO L226 Difference]: Without dead ends: 27 [2023-11-26 11:50:51,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:51,130 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:51,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:50:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-26 11:50:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-26 11:50:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:50:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-26 11:50:51,182 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2023-11-26 11:50:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:51,183 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-26 11:50:51,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-26 11:50:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-26 11:50:51,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:51,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:51,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:50:51,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:51,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-11-26 11:50:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79095437] [2023-11-26 11:50:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79095437] [2023-11-26 11:50:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79095437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822825016] [2023-11-26 11:50:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:51,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:51,278 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:51,317 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-11-26 11:50:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:51,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-26 11:50:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:51,319 INFO L225 Difference]: With dead ends: 31 [2023-11-26 11:50:51,319 INFO L226 Difference]: Without dead ends: 26 [2023-11-26 11:50:51,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:51,321 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:51,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:50:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-26 11:50:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-26 11:50:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:50:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-26 11:50:51,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-11-26 11:50:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:51,330 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-26 11:50:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-26 11:50:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:50:51,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:51,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:51,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:50:51,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:51,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2023-11-26 11:50:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860296433] [2023-11-26 11:50:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:51,350 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-26 11:50:51,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766565033] [2023-11-26 11:50:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:50:51,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:51,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:50:51,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:50:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:51,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-26 11:50:51,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:51,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:50:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860296433] [2023-11-26 11:50:51,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-26 11:50:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766565033] [2023-11-26 11:50:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766565033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:50:51,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:50:51,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-26 11:50:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845826847] [2023-11-26 11:50:51,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:50:51,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:50:51,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:51,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:50:51,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:50:51,605 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:51,670 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-11-26 11:50:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-26 11:50:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:51,672 INFO L225 Difference]: With dead ends: 32 [2023-11-26 11:50:51,672 INFO L226 Difference]: Without dead ends: 27 [2023-11-26 11:50:51,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:50:51,674 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:51,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:50:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-26 11:50:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-26 11:50:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:50:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-26 11:50:51,681 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-11-26 11:50:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:51,682 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-26 11:50:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-26 11:50:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 11:50:51,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:51,684 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:51,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-26 11:50:51,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-26 11:50:51,890 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:51,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash -755233492, now seen corresponding path program 2 times [2023-11-26 11:50:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905829164] [2023-11-26 11:50:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:51,916 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-26 11:50:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221512164] [2023-11-26 11:50:51,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:50:51,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:50:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:51,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:50:51,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb82d6fa-0ddb-4bc2-9c19-75a70ae04ceb/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:50:52,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:50:52,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:50:52,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-26 11:50:52,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:25,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:40,398 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse10 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse71 (mod |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse72 (mod .cse4 256))) (let ((.cse57 (< .cse72 128)) (.cse2 (+ 257 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse58 (< .cse71 128)) (.cse55 (< 0 .cse10)) (.cse66 (< 127 .cse72)) (.cse63 (< 127 .cse71)) (.cse56 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (not (= (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (let ((.cse7 (or .cse55 .cse66 .cse63 .cse56)) (.cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse70 256))) (or (< .cse69 .cse10) (< 127 (mod (+ .cse70 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse68 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse68 256))) (or (< .cse67 .cse10) (< (mod (+ .cse68 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse68 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse67)))))) (.cse21 (or .cse55 .cse66 .cse56 .cse58)) (.cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse65 256))) (or (< .cse64 .cse2) (< .cse64 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse65 .cse4) 256) 128)))))) (.cse35 (or .cse55 .cse63 .cse56 .cse57)) (.cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod .cse62 256))) (or (< .cse61 .cse10) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse61) (< 127 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse62 .cse4) 256) 128)))))) (.cse26 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse60 256))) (or (< .cse59 .cse2) (< .cse59 128) (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse60 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (.cse12 (or .cse55 .cse56 .cse57 .cse58)) (.cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (< .cse53 .cse10) (< (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse53) (< (mod (+ .cse54 .cse4) 256) 128)))))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse51 (mod .cse52 256))) (or (< .cse51 .cse2) (< .cse51 128) (< 127 (mod (+ .cse52 .cse4) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (.cse6 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse50 256))) (or (< .cse49 .cse2) (< .cse49 128) (< (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse50 .cse4) 256) 128))))))) (and (or (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse3 .cse4) 256))) (or (< .cse1 .cse2) (< (mod .cse3 256) 128) (< 127 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse1 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) .cse5) (or .cse6 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse9 .cse10) (< 127 (mod (+ .cse11 .cse4) 256)) (< 127 (mod .cse11 256)) (< 127 .cse9) (= .cse11 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse12 .cse13 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse14 128) (< .cse14 .cse2) (< 127 (mod .cse15 256)) (< (mod (+ .cse15 .cse4) 256) 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and .cse7 .cse8 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 .cse4) 256))) (or (< 127 .cse16) (< .cse16 .cse10) (< 127 (mod .cse17 256)) (< 127 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse17 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse19 .cse4) 256))) (or (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse20) (< .cse20 .cse10) (< 127 (mod .cse19 256)) (= .cse19 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21) .cse5) (or .cse6 (and .cse18 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse22 128) (< .cse22 .cse2) (< 127 (mod (+ .cse23 .cse4) 256)) (< 127 (mod .cse23 256)) (= .cse23 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse21)) (or .cse6 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse24 256) 128) (< .cse25 128) (< .cse25 .cse2) (< 127 (mod (+ .cse24 .cse4) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26)) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse28 .cse4) 256))) (or (< .cse27 .cse2) (< (mod .cse28 256) 128) (< (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse27 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse29)) (or .cse6 (and .cse0 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse30 256) 128) (< .cse31 .cse10) (< 127 .cse31) (< (mod (+ .cse30 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse33 256) 128) (< .cse34 .cse10) (< 127 (mod (+ .cse33 .cse4) 256)) (< 127 .cse34) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse35 .cse36 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< .cse37 .cse10) (< 127 (mod .cse38 256)) (< 127 .cse37) (< (mod (+ .cse38 .cse4) 256) 128) (= .cse38 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse40 .cse4) 256))) (or (< .cse39 .cse2) (< 127 (mod .cse40 256)) (< 127 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse39 128) (= .cse40 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse35 .cse36)) (or (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse4) 256))) (or (< (mod .cse41 256) 128) (< (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse42) (< .cse42 .cse10) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse26) .cse5) (or .cse5 (and (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse44 .cse4) 256))) (or (< .cse43 .cse2) (< (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod .cse44 256)) (< .cse43 128) (= .cse44 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))) .cse12 .cse13)) (or .cse5 (and .cse32 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 .cse4) 256))) (or (< (mod .cse45 256) 128) (< 127 .cse46) (< .cse46 .cse10) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (or .cse6 (and .cse29 (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod .cse47 256) 128) (< .cse48 128) (< .cse48 .cse2) (< (mod (+ .cse47 .cse4) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) (< 126 |c_ULTIMATE.start_main1_~y~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true