./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/gcd_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:41:46,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:41:46,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:41:46,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:41:46,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:41:46,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:41:46,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:41:46,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:41:46,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:41:46,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:41:46,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:41:46,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:41:46,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:41:46,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:41:46,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:41:46,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:41:46,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:41:46,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:41:46,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:41:46,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:41:46,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:41:46,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:41:46,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:41:46,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:41:46,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:41:46,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:41:46,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:41:46,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:41:46,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:41:46,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:41:46,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:41:46,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:41:46,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:41:46,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:41:46,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:41:46,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:41:46,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:41:46,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:41:46,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:41:46,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:41:46,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:41:46,412 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:41:46,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:41:46,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:41:46,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:41:46,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:41:46,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:41:46,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:41:46,474 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:41:46,474 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:41:46,475 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:41:46,475 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:41:46,476 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:41:46,477 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:41:46,477 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:41:46,477 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:41:46,478 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:41:46,478 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:41:46,478 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:41:46,478 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:41:46,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:41:46,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:41:46,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:41:46,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:41:46,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:41:46,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:41:46,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:41:46,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:41:46,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:41:46,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:41:46,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:41:46,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:41:46,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:41:46,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:41:46,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:41:46,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:41:46,486 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:41:46,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:41:46,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:41:46,487 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:41:46,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:41:46,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:41:46,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:41:46,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/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_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb [2022-11-03 01:41:46,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:41:46,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:41:46,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:41:46,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:41:46,935 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:41:46,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/bitvector/gcd_2.c [2022-11-03 01:41:47,042 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/data/6a59a31ac/d783373d164e4bf59db750061661d995/FLAG3ade4bba6 [2022-11-03 01:41:47,696 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:41:47,697 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/sv-benchmarks/c/bitvector/gcd_2.c [2022-11-03 01:41:47,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/data/6a59a31ac/d783373d164e4bf59db750061661d995/FLAG3ade4bba6 [2022-11-03 01:41:48,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/data/6a59a31ac/d783373d164e4bf59db750061661d995 [2022-11-03 01:41:48,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:41:48,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:41:48,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:41:48,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:41:48,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:41:48,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b6acf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48, skipping insertion in model container [2022-11-03 01:41:48,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:41:48,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:41:48,319 WARN L230 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_525b310f-4135-4542-b72c-e00e7f2449e6/sv-benchmarks/c/bitvector/gcd_2.c[664,677] [2022-11-03 01:41:48,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:41:48,347 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:41:48,362 WARN L230 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_525b310f-4135-4542-b72c-e00e7f2449e6/sv-benchmarks/c/bitvector/gcd_2.c[664,677] [2022-11-03 01:41:48,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:41:48,386 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:41:48,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48 WrapperNode [2022-11-03 01:41:48,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:41:48,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:41:48,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:41:48,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:41:48,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,430 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2022-11-03 01:41:48,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:41:48,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:41:48,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:41:48,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:41:48,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,456 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:41:48,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:41:48,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:41:48,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:41:48,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (1/1) ... [2022-11-03 01:41:48,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:41:48,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:48,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:41:48,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:41:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:41:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:41:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:41:48,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:41:48,640 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:41:48,642 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:41:48,868 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:41:48,984 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:41:48,984 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:41:48,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:41:48 BoogieIcfgContainer [2022-11-03 01:41:48,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:41:48,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:41:48,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:41:49,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:41:49,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:41:48" (1/3) ... [2022-11-03 01:41:49,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b3db13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:41:49, skipping insertion in model container [2022-11-03 01:41:49,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:48" (2/3) ... [2022-11-03 01:41:49,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b3db13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:41:49, skipping insertion in model container [2022-11-03 01:41:49,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:41:48" (3/3) ... [2022-11-03 01:41:49,025 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2.c [2022-11-03 01:41:49,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:41:49,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:41:49,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:41:49,127 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3c461ff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:41:49,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:41:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2022-11-03 01:41:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:41:49,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:49,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:41:49,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 84816067, now seen corresponding path program 1 times [2022-11-03 01:41:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:49,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945657502] [2022-11-03 01:41:49,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:49,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:49,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945657502] [2022-11-03 01:41:49,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945657502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:49,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:49,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:41:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907899084] [2022-11-03 01:41:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:49,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:41:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:41:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:41:49,795 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-11-03 01:41:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:49,902 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-11-03 01:41:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:41:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-03 01:41:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:49,918 INFO L225 Difference]: With dead ends: 19 [2022-11-03 01:41:49,919 INFO L226 Difference]: Without dead ends: 7 [2022-11-03 01:41:49,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:41:49,928 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:49,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-03 01:41:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-03 01:41:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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) [2022-11-03 01:41:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-03 01:41:49,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-03 01:41:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:49,973 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-03 01:41:49,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-11-03 01:41:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-03 01:41:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:41:49,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:49,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 01:41:49,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:41:49,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1696327067, now seen corresponding path program 1 times [2022-11-03 01:41:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:49,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303463952] [2022-11-03 01:41:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:49,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:41:49,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967104582] [2022-11-03 01:41:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:49,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:49,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:50,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:50,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:41:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:50,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:41:50,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:50,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:50,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:50,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303463952] [2022-11-03 01:41:50,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:41:50,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967104582] [2022-11-03 01:41:50,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967104582] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2101609988] [2022-11-03 01:41:50,939 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-11-03 01:41:50,939 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:50,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:41:50,949 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:41:50,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:41:52,084 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:41:52,511 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '90#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (< 0 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 128)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= (ite (<= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_main_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:41:52,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:41:52,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:41:52,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-03 01:41:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328607604] [2022-11-03 01:41:52,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:41:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:41:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:41:52,515 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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) [2022-11-03 01:41:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:52,781 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-11-03 01:41:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:41:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 6 [2022-11-03 01:41:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:52,784 INFO L225 Difference]: With dead ends: 14 [2022-11-03 01:41:52,784 INFO L226 Difference]: Without dead ends: 9 [2022-11-03 01:41:52,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:41:52,786 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:52,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 13 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-03 01:41:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-03 01:41:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2022-11-03 01:41:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-03 01:41:52,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-11-03 01:41:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:52,795 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-03 01:41:52,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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) [2022-11-03 01:41:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-03 01:41:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:41:52,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:52,796 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2022-11-03 01:41:52,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:53,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:53,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash 936209957, now seen corresponding path program 2 times [2022-11-03 01:41:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:53,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946166055] [2022-11-03 01:41:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:53,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:41:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983619304] [2022-11-03 01:41:53,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:41:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:53,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:53,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:41:53,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:41:53,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:53,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:41:53,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:02,507 WARN L234 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 109 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:34,689 WARN L234 SmtUtils]: Spent 3.28m on a formula simplification. DAG size of input: 235 DAG size of output: 183 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:48:48,074 WARN L234 SmtUtils]: Spent 3.00m on a formula simplification. DAG size of input: 229 DAG size of output: 215 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:50:56,231 WARN L234 SmtUtils]: Spent 1.90m on a formula simplification. DAG size of input: 185 DAG size of output: 178 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:50:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:58,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:44,805 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse10 (not .cse5)) (.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod (+ .cse1 .cse2) 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse0)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse0 127) (<= (mod .cse1 256) 127))))) (< |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse4 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (mod .cse4 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse3)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse4 .cse2) 256) 127) (<= .cse3 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) .cse5) (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 ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse6 256))) (or (not (<= (mod (+ .cse6 .cse2) 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse7)) 256) |c_ULTIMATE.start_main_~y~0#1|) (<= .cse7 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (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 ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ .cse9 .cse2) 256))) (or (not (<= .cse8 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse8 0) (<= (mod .cse9 256) 127) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse8) 256) |c_ULTIMATE.start_main_~y~0#1|)))))))) .cse5) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse11)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse12 .cse2) 256) 127) (<= (mod .cse12 256) 127) (<= .cse11 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (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 ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod .cse14 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse13)) 256) |c_ULTIMATE.start_main_~y~0#1|) (<= (mod (+ .cse14 .cse2) 256) 127) (<= .cse13 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse16 256))) (or (= .cse15 0) (<= (mod (+ .cse16 .cse2) 256) 127) (not (<= .cse15 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse15) 256) |c_ULTIMATE.start_main_~y~0#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 (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#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 ((.cse17 (mod (+ .cse18 .cse2) 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse17)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse17 127) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))))) .cse5) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse19)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse20 .cse2) 256) 127) (not (<= (mod .cse20 256) 127)) (<= .cse19 127) (= .cse20 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (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 ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse22 256))) (or (= .cse21 0) (<= (mod (+ .cse22 .cse2) 256) 127) (not (<= .cse21 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse21) 256) |c_ULTIMATE.start_main_~y~0#1|)))))))) .cse10) (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 ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse24 .cse2) 256))) (or (not (<= .cse23 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse23 0) (<= (mod .cse24 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse23) 256) |c_ULTIMATE.start_main_~y~0#1|))))))) (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 ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod .cse25 256))) (or (not (<= (mod (+ .cse25 .cse2) 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse26)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse26 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) .cse5) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (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 .cse2) 256))) (or (not (<= .cse27 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse27 0) (not (<= (mod .cse28 256) 127)) (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse27) 256) |c_ULTIMATE.start_main_~y~0#1|) (= .cse28 0))))) (< |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse29 256))) (or (not (<= (mod (+ .cse29 .cse2) 256) 127)) (= .cse30 0) (not (<= .cse30 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30) 256) |c_ULTIMATE.start_main_~y~0#1|)))))))) .cse5) (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 ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse31 127)) (<= (mod (+ .cse32 .cse2) 256) 127) (= 0 .cse31) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse31) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod .cse32 256) 127)) (= .cse32 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse34 256))) (or (= .cse33 0) (not (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse34 .cse2) 256) 127) (not (<= .cse33 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse33) 256) |c_ULTIMATE.start_main_~y~0#1|))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0)))) .cse10) (or .cse10 (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 ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (mod .cse35 256))) (or (not (<= (mod (+ .cse35 .cse2) 256) 127)) (= .cse36 0) (not (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse36 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse36) 256) |c_ULTIMATE.start_main_~y~0#1|))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse37 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse38 127)) (= 0 .cse38) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod .cse37 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse10 (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 ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod .cse40 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse39)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse40 .cse2) 256) 127) (<= .cse39 127) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (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 ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse41 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= (mod .cse42 256) 127) (= 0 .cse41) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41) 256) |c_ULTIMATE.start_main_~y~0#1|))))))))) (or (and (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 ((.cse43 (mod (+ .cse44 .cse2) 256))) (or (not (<= .cse43 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse43 0) (not (<= (mod .cse44 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse43) 256) |c_ULTIMATE.start_main_~y~0#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 (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 256))) (or (not (<= (mod (+ .cse45 .cse2) 256) 127)) (= .cse46 0) (not (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256) |c_ULTIMATE.start_main_~y~0#1|))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse5) (or .cse10 (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 ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod .cse47 256))) (or (not (<= (mod (+ .cse47 .cse2) 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse48)) 256) |c_ULTIMATE.start_main_~y~0#1|) (<= .cse48 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (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 ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse49 .cse2) 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse50)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse49 256) 127) (<= .cse50 127))))))))) (or (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 ((.cse51 (mod (+ .cse52 .cse2) 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse51)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse51 127) (<= (mod .cse52 256) 127) (<= (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) (< |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse53 (mod .cse54 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse53)) 256) |c_ULTIMATE.start_main_~y~0#1|) (<= (mod (+ .cse54 .cse2) 256) 127) (<= .cse53 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) .cse5) (or .cse10 (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 ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse56 (mod .cse55 256))) (or (not (<= (mod (+ .cse55 .cse2) 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse56)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse56 127) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse57 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse58 (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse57 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse58 127)) (<= (mod .cse57 256) 127) (= 0 .cse58) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse58) 256) |c_ULTIMATE.start_main_~y~0#1|))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse10 (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 ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse59 256))) (or (not (<= (mod (+ .cse59 .cse2) 256) 127)) (= .cse60 0) (not (<= .cse60 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse60) 256) |c_ULTIMATE.start_main_~y~0#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 ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse61 .cse2) 256) 127)) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse62)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse61 256) 127)) (<= .cse62 127) (= .cse61 0))))))))) (or .cse5 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod .cse64 256))) (or (= .cse63 0) (not (<= (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse64 .cse2) 256) 127) (not (<= .cse63 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse63) 256) |c_ULTIMATE.start_main_~y~0#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 (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod (+ .cse66 .cse2) 256))) (or (<= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| (+ (- 256) .cse65)) 256) |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse65 127) (not (<= (mod .cse66 256) 127)) (= .cse66 0)))))))))))) (not (< 0 |c_ULTIMATE.start_main_~y~0#1|))) is different from true [2022-11-03 01:51:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:51:44,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946166055] [2022-11-03 01:51:44,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 01:51:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983619304] [2022-11-03 01:51:44,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983619304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [547983388] [2022-11-03 01:51:44,811 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-11-03 01:51:44,811 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:51:44,812 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:51:44,812 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:51:44,812 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:51:45,139 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:51:54,269 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '188#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (< 0 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 128)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= (ite (<= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_main_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:51:54,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:51:54,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:51:54,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-03 01:51:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774460689] [2022-11-03 01:51:54,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:51:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:51:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=178, Unknown=11, NotChecked=28, Total=272 [2022-11-03 01:51:54,273 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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) [2022-11-03 01:52:10,919 WARN L234 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:53:20,880 WARN L234 SmtUtils]: Spent 56.37s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:53:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:21,517 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-11-03 01:53:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:53:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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 8 [2022-11-03 01:53:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:21,518 INFO L225 Difference]: With dead ends: 17 [2022-11-03 01:53:21,518 INFO L226 Difference]: Without dead ends: 12 [2022-11-03 01:53:21,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 636.4s TimeCoverageRelationStatistics Valid=75, Invalid=255, Unknown=16, NotChecked=34, Total=380 [2022-11-03 01:53:21,520 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:21,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-11-03 01:53:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-03 01:53:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-03 01:53:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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) [2022-11-03 01:53:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-03 01:53:21,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-11-03 01:53:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:21,531 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-03 01:53:21,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 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) [2022-11-03 01:53:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-03 01:53:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:53:21,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:21,532 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2022-11-03 01:53:21,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:21,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:21,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1265263229, now seen corresponding path program 3 times [2022-11-03 01:53:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:21,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180764560] [2022-11-03 01:53:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:21,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 01:53:21,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184597895] [2022-11-03 01:53:21,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:53:21,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:21,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:21,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:21,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_525b310f-4135-4542-b72c-e00e7f2449e6/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:53:22,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:53:22,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:22,004 WARN L261 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:53:22,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:35,504 WARN L234 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 109 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:53:40,347 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (let ((.cse2 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse32 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0)) (not (<= .cse40 127)) (= .cse40 .cse32))))) (.cse0 (not .cse2)) (.cse9 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (* |c_ULTIMATE.start_main_~y~0#1| 255)) (.cse16 (< |c_ULTIMATE.start_main_~y~0#1| 0))) (or (and (let ((.cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse3 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse3) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|)))) .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 256)) (= .cse5 0) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))))))) (or (and .cse0 .cse1) (and .cse2 .cse1))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse6 (mod (+ .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|)) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse6) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (<= .cse6 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (and (not (<= (mod .cse8 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= .cse9 (mod (+ .cse7 .cse8) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|) 256))) (and (= .cse9 .cse10) (not (<= .cse10 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse12 (mod .cse11 256))) (and (not (<= (mod (+ .cse7 .cse11) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse12) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (<= .cse12 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse13 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (<= (mod (+ .cse7 .cse13) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse14 (mod (+ .cse7 .cse15) 256))) (and (not (<= .cse14 127)) (not (= .cse15 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= .cse9 .cse14) (<= (mod .cse15 256) 127)))))) (not .cse16)) (and (let ((.cse19 (mod .cse7 256))) (let ((.cse21 (<= .cse19 127))) (or (and (let ((.cse17 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse18 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse18) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_34|)))) .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse20 256)) (= .cse20 0) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_34|))))))) (or (and .cse2 .cse17) (and .cse17 .cse0))) .cse21 (let ((.cse23 (* 255 .cse19))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19))) (and (= (mod .cse22 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ .cse22 .cse23) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= (mod (+ .cse24 .cse23) 256) .cse9) (not (<= (mod .cse24 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse25 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19) .cse23) 256))) (and (= .cse25 |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse25 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19))) (let ((.cse26 (mod (+ .cse27 .cse23) 256))) (and (not (<= .cse26 127)) (<= (mod .cse27 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= .cse26 .cse9) (not (= .cse27 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (= .cse28 .cse9) (not (<= .cse28 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19))) (let ((.cse30 (mod .cse29 256))) (and (not (<= (mod (+ .cse29 .cse23) 256) 127)) (= .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse30 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0))))))))) (and (let ((.cse33 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse19 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse37 256)) (= .cse37 0))))) (.cse34 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse36 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse36) (not (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0))))))) (or (and .cse2 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse31 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse31) 256) .cse32) (<= .cse19 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|))))) .cse33 .cse4 .cse34)) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse35 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0) (<= .cse19 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse35) 256) .cse32)))) .cse33 .cse4 .cse34) .cse0))) (let ((.cse39 (+ (- 256) .cse19))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse39))) (and (not (= .cse38 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= .cse9 (mod (+ .cse38 .cse19) 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse39) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)))))) (not .cse21))))) .cse16))))) is different from false [2022-11-03 01:53:48,916 WARN L234 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:53:54,227 WARN L234 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:54:02,152 WARN L234 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:54:22,604 WARN L234 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:54:28,174 WARN L234 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:54:50,007 WARN L234 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:54:55,425 WARN L234 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:55:08,978 WARN L234 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:55:31,266 WARN L234 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 01:56:01,244 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_main_~y~0#1| 0)) (.cse12 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| 255))) (or (and (not .cse0) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse1 (mod (+ .cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|)) 256))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (= .cse1 0)) (<= .cse1 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse1) 256))) (and (<= .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (mod .cse1 .cse2) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse2 0)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse5 (mod .cse4 256))) (and (not (<= (mod (+ .cse3 .cse4) 256) 127)) (not (= .cse5 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse5) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 .cse6) 256)) (<= .cse6 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse6 0)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|)))) (<= .cse5 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse9 (mod (+ .cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|)) 256))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse9) 256))) (let ((.cse8 (mod .cse9 .cse7))) (and (<= .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse8 0) (= (mod .cse8 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse7 0)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))))) (not (= .cse9 0)) (<= .cse9 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse14 (+ (- 256) (mod (+ .cse3 .cse13) 256)))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse14) 256))) (let ((.cse10 (mod .cse14 .cse11))) (and (not (= .cse10 0)) (not (= .cse11 0)) (<= .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ (* .cse11 255) .cse10) 256) .cse12) (not (<= (mod .cse13 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0))))))) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|) 256))) (let ((.cse18 (+ (- 256) .cse17))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse18) 256))) (let ((.cse16 (mod .cse18 .cse15))) (and (not (= .cse15 0)) (not (= .cse16 0)) (not (<= .cse17 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (<= .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ .cse16 (* .cse15 255)) 256) .cse12))))))) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse22 (+ (- 256) (mod (+ .cse3 .cse20) 256)))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse22) 256))) (let ((.cse21 (mod .cse22 .cse19))) (and (not (= .cse19 0)) (<= .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= (mod .cse20 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (= .cse21 0))))))) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse23 (mod .cse25 256))) (and (not (= .cse23 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse23) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse23 .cse24) 256)) (<= .cse24 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse24 0)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|)))) (<= (mod (+ .cse3 .cse25) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse27 (mod (+ .cse3 .cse28) 256))) (let ((.cse30 (+ (- 256) .cse27))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse30) 256))) (let ((.cse29 (mod .cse30 .cse26))) (and (not (= .cse26 0)) (not (<= .cse27 127)) (<= .cse26 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse28 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse29 256)) (<= (mod .cse28 256) 127) (= .cse29 0)))))))) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse32 (mod .cse31 256))) (and (not (<= (mod (+ .cse3 .cse31) 256) 127)) (not (= .cse32 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (<= .cse32 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse32) 256))) (let ((.cse33 (mod .cse32 .cse34))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 256)) (<= .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse33 0) (not (= .cse34 0)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse35 (mod .cse36 256))) (and (not (= .cse35 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (<= (mod (+ .cse3 .cse36) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse38 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse35) 256))) (let ((.cse37 (mod .cse35 .cse38))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse37 256)) (<= .cse38 |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse37 0) (not (= .cse38 0)) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|) 256))) (let ((.cse42 (+ (- 256) .cse40))) (let ((.cse39 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse42) 256))) (let ((.cse41 (mod .cse42 .cse39))) (and (not (= .cse39 0)) (not (<= .cse40 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (= .cse41 0) (<= .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256)))))))) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse45 (mod (+ .cse3 .cse46) 256))) (let ((.cse47 (+ (- 256) .cse45))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse47) 256))) (let ((.cse43 (mod .cse47 .cse44))) (and (not (= .cse43 0)) (not (= .cse44 0)) (not (<= .cse45 127)) (<= .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse46 0)) (= (mod (+ (* .cse44 255) .cse43) 256) .cse12) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (<= (mod .cse46 256) 127)))))))) (<= |c_ULTIMATE.start_main_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_34|))))) (and .cse0 (let ((.cse52 (mod .cse3 256))) (let ((.cse82 (<= .cse52 127))) (or (and (let ((.cse58 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse53 (+ (- 256) .cse52))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse50 (+ (mod (+ .cse51 .cse52) 256) (- 256)))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse50) 256))) (let ((.cse49 (mod .cse50 .cse48))) (and (<= .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse48 0)) (= .cse49 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse49 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0))))))) (not (= .cse51 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53) 256))) (and (not (= .cse54 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse54))) (let ((.cse57 (mod (+ (* 255 .cse54) .cse56) 256))) (let ((.cse55 (mod .cse54 (+ (- 256) .cse57)))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0) (<= .cse52 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse55 256)) (not (= .cse56 0)) (= .cse55 0) (<= .cse57 .cse58))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse59 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse61) 256))) (let ((.cse60 (mod .cse61 .cse59))) (and (not (= .cse59 0)) (<= .cse59 |c_ULTIMATE.start_gcd_test_~a#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse60 256)) (= .cse60 0))))) (not (= .cse61 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53))) (and (not (= .cse62 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse66 (mod (+ .cse62 .cse52) 256))) (let ((.cse65 (+ .cse66 (- 256)))) (let ((.cse64 (mod (+ .cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse65)) 256))) (let ((.cse63 (mod .cse65 (+ .cse64 (- 256))))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0) (<= .cse52 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (not (= .cse63 0)) (= (mod (+ .cse64 .cse63) 256) .cse12) (<= .cse64 .cse58)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53) 256))) (and (not (= .cse67 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse67))) (let ((.cse68 (mod (+ (* 255 .cse67) .cse69) 256))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0) (<= .cse52 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse67 (+ (- 256) .cse68)) 256)) (not (= .cse69 0)) (<= .cse68 .cse58)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53))) (and (not (= .cse70 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse73 (+ (mod (+ .cse70 .cse52) 256) (- 256)))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse73) 256))) (let ((.cse71 (mod .cse73 .cse72))) (and (= (mod (+ .cse71 (* .cse72 255)) 256) .cse12) (<= .cse72 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse72 0)) (not (= .cse71 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse74 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53) 256))) (and (not (= .cse74 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse75 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse74) 256))) (and (not (= .cse75 0)) (<= .cse75 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse74 .cse75) 256))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse53))) (and (not (= .cse76 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse81 (mod (+ .cse76 .cse52) 256))) (let ((.cse80 (+ .cse81 (- 256)))) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse80))) (let ((.cse79 (mod (+ .cse81 .cse78) 256))) (let ((.cse77 (mod .cse80 (+ .cse79 (- 256))))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_34| 0) (<= .cse52 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_34|)) (= (mod .cse77 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse78 0)) (= .cse77 0) (<= .cse79 .cse58)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)))))) (not .cse82)) (and (let ((.cse84 (* 255 .cse52))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse83 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (let ((.cse85 (mod .cse83 256))) (and (not (<= (mod (+ .cse83 .cse84) 256) 127)) (<= .cse85 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse85) 256))) (let ((.cse87 (mod .cse85 .cse86))) (and (<= .cse86 |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse87 0) (not (= .cse86 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod .cse87 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) (not (= .cse85 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse88 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (let ((.cse91 (mod .cse88 256))) (and (<= (mod (+ .cse88 .cse84) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse89 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse91) 256))) (let ((.cse90 (mod .cse91 .cse89))) (and (<= .cse89 |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse90 0) (not (= .cse89 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod .cse90 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) (not (= .cse91 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse95 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse94 (+ .cse95 (- 256)))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse94) 256))) (let ((.cse92 (mod .cse94 .cse93))) (and (= .cse92 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse92 256)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (<= .cse93 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse93 0))))))) (not (<= .cse95 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse96 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52) .cse84) 256))) (and (not (= .cse96 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse97 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse96) 256))) (let ((.cse98 (mod .cse96 .cse97))) (and (not (= .cse97 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= .cse98 0) (<= .cse97 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse98 256) |c_ULTIMATE.start_gcd_test_~b#1|))))) (<= .cse96 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse99 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (<= (mod .cse99 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse102 (+ (mod (+ .cse99 .cse84) 256) (- 256)))) (let ((.cse101 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse102) 256))) (let ((.cse100 (mod .cse102 .cse101))) (and (= .cse100 0) (<= .cse101 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse101 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod .cse100 256) |c_ULTIMATE.start_gcd_test_~b#1|))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse104 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (let ((.cse103 (mod (+ .cse104 .cse84) 256))) (and (not (<= .cse103 127)) (<= (mod .cse104 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (= .cse104 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse107 (+ .cse103 (- 256)))) (let ((.cse106 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse107) 256))) (let ((.cse105 (mod .cse107 .cse106))) (and (= .cse105 0) (<= .cse106 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse106 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod .cse105 256) |c_ULTIMATE.start_gcd_test_~b#1|)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse108 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (<= (mod .cse108 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse111 (+ (mod (+ .cse108 .cse84) 256) (- 256)))) (let ((.cse109 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse111) 256))) (let ((.cse110 (mod .cse111 .cse109))) (and (<= .cse109 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse109 0)) (= (mod (+ .cse110 (* 255 .cse109)) 256) .cse12) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (not (= .cse110 0)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (let ((.cse113 (mod .cse112 256))) (and (not (<= (mod (+ .cse112 .cse84) 256) 127)) (<= .cse113 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse114 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse113) 256))) (and (<= .cse114 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse114 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod (mod .cse113 .cse114) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (= .cse113 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse118 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse117 (+ .cse118 (- 256)))) (let ((.cse116 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse117) 256))) (let ((.cse115 (mod .cse117 .cse116))) (and (= .cse12 (mod (+ .cse115 (* 255 .cse116)) 256)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (<= .cse116 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse115 0)) (not (= .cse116 0))))))) (not (<= .cse118 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse119 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (let ((.cse121 (mod .cse119 256))) (and (<= (mod (+ .cse119 .cse84) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse120 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse121) 256))) (and (<= .cse120 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse120 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= (mod (mod .cse121 .cse120) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (= .cse121 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse122 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52) .cse84) 256))) (and (not (= .cse122 0)) (<= .cse122 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse123 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse122) 256))) (and (not (= .cse123 0)) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (<= .cse123 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (mod .cse122 .cse123) 256) |c_ULTIMATE.start_gcd_test_~b#1|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse125 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse52))) (let ((.cse124 (mod (+ .cse125 .cse84) 256))) (and (not (<= .cse124 127)) (<= (mod .cse125 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (= .cse125 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse128 (+ .cse124 (- 256)))) (let ((.cse126 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| .cse128) 256))) (let ((.cse127 (mod .cse128 .cse126))) (and (<= .cse126 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse126 0)) (= (mod (+ .cse127 (* 255 .cse126)) 256) .cse12) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_34|) (not (= .cse127 0))))))))))))) .cse82))))))) (<= |c_ULTIMATE.start_main_~y~0#1| 127)) is different from false