./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh --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 b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- 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-2329fc7 [2022-12-14 09:19:22,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:19:22,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:19:22,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:19:22,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:19:22,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:19:22,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:19:22,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:19:22,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:19:22,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:19:22,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:19:22,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:19:22,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:19:22,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:19:22,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:19:22,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:19:22,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:19:22,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:19:22,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:19:22,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:19:22,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:19:22,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:19:22,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:19:22,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:19:22,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:19:22,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:19:22,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:19:22,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:19:22,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:19:22,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:19:22,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:19:22,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:19:22,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:19:22,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:19:22,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:19:22,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:19:22,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:19:22,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:19:22,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:19:22,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:19:22,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:19:22,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 09:19:22,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:19:22,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:19:22,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:19:22,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:19:22,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:19:22,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:19:22,486 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:19:22,486 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:19:22,486 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:19:22,486 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:19:22,486 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:19:22,486 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:19:22,487 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:19:22,487 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:19:22,487 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:19:22,487 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:19:22,487 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:19:22,487 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:19:22,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:19:22,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:19:22,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:19:22,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:19:22,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:19:22,490 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:19:22,490 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_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/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_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh 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 -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2022-12-14 09:19:22,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:19:22,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:19:22,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:19:22,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:19:22,677 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:19:22,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2022-12-14 09:19:25,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:19:25,300 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:19:25,301 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2022-12-14 09:19:25,306 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/data/2b96d65f5/65a4b802f3624acd8a7150b4d2cb430f/FLAGb6edd42c6 [2022-12-14 09:19:25,719 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/data/2b96d65f5/65a4b802f3624acd8a7150b4d2cb430f [2022-12-14 09:19:25,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:19:25,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:19:25,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:19:25,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:19:25,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:19:25,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c526fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25, skipping insertion in model container [2022-12-14 09:19:25,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:19:25,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:19:25,867 WARN L237 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_e13143d3-358d-4f88-9925-7c201dd44b54/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2022-12-14 09:19:25,883 WARN L237 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_e13143d3-358d-4f88-9925-7c201dd44b54/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2022-12-14 09:19:25,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:19:25,892 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:19:25,901 WARN L237 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_e13143d3-358d-4f88-9925-7c201dd44b54/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2022-12-14 09:19:25,907 WARN L237 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_e13143d3-358d-4f88-9925-7c201dd44b54/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2022-12-14 09:19:25,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:19:25,918 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:19:25,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25 WrapperNode [2022-12-14 09:19:25,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:19:25,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:19:25,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:19:25,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:19:25,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,944 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-12-14 09:19:25,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:19:25,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:19:25,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:19:25,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:19:25,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:19:25,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:19:25,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:19:25,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:19:25,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (1/1) ... [2022-12-14 09:19:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:19:25,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:19:25,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:19:25,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:19:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:19:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-12-14 09:19:26,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-12-14 09:19:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-12-14 09:19:26,024 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-12-14 09:19:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:19:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:19:26,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:19:26,085 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:19:26,087 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:19:26,212 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:19:26,252 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:19:26,252 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 09:19:26,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:19:26 BoogieIcfgContainer [2022-12-14 09:19:26,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:19:26,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:19:26,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:19:26,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:19:26,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:19:25" (1/3) ... [2022-12-14 09:19:26,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb6775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:19:26, skipping insertion in model container [2022-12-14 09:19:26,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:19:25" (2/3) ... [2022-12-14 09:19:26,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb6775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:19:26, skipping insertion in model container [2022-12-14 09:19:26,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:19:26" (3/3) ... [2022-12-14 09:19:26,261 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2022-12-14 09:19:26,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:19:26,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 09:19:26,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:19:26,318 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;@619f1422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:19:26,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 09:19:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:19:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 09:19:26,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:19:26,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 09:19:26,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:19:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:19:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2022-12-14 09:19:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:19:26,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501166919] [2022-12-14 09:19:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:19:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:19:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:19:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:19:26,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:19:26,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501166919] [2022-12-14 09:19:26,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501166919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:19:26,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:19:26,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:19:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928165074] [2022-12-14 09:19:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:19:26,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:19:26,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:19:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:19:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:19:26,669 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-12-14 09:19:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:19:26,780 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-12-14 09:19:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:19:26,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-12-14 09:19:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:19:26,789 INFO L225 Difference]: With dead ends: 45 [2022-12-14 09:19:26,789 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 09:19:26,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:19:26,793 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:19:26,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:19:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 09:19:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-14 09:19:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:19:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-12-14 09:19:26,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-12-14 09:19:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:19:26,821 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-12-14 09:19:26,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-12-14 09:19:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-12-14 09:19:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 09:19:26,822 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:19:26,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:19:26,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:19:26,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:19:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:19:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2022-12-14 09:19:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:19:26,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750996828] [2022-12-14 09:19:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:19:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:19:26,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 09:19:26,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308782863] [2022-12-14 09:19:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:19:26,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:19:26,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:19:26,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:19:26,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:19:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:19:26,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 09:19:26,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:19:34,429 WARN L233 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:19:36,717 WARN L859 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (< |c_ULTIMATE.start_main1_~x~0#1| 0) (let ((.cse1 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= .cse1 127))) (or (and (not .cse0) (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= 0 (mod (+ .cse1 (- 256)) |ULTIMATE.start_gcd_test_#res#1|)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (not (= |ULTIMATE.start_gcd_test_#res#1| 0))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= (mod (mod .cse1 |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))))))))) is different from true [2022-12-14 09:19:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:19:37,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:19:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:19:43,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:19:43,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750996828] [2022-12-14 09:19:43,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 09:19:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308782863] [2022-12-14 09:19:43,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308782863] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:19:43,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262541140] [2022-12-14 09:19:43,243 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 09:19:43,244 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:19:43,246 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:19:43,250 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:19:43,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:19:45,489 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:19:48,465 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '175#(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_main1_~x~0#1|) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)) (= |#NULL.base| 0))' at error location [2022-12-14 09:19:48,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:19:48,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:19:48,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-12-14 09:19:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452817983] [2022-12-14 09:19:48,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:19:48,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 09:19:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:19:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 09:19:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=146, Unknown=2, NotChecked=24, Total=210 [2022-12-14 09:19:48,468 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-12-14 09:19:50,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 09:19:52,919 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse10 (<= .cse11 127))) (let ((.cse4 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse9 (not .cse10)) (.cse8 (+ .cse11 (- 256))) (.cse0 (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))) (and (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (< 127 |ULTIMATE.start_gcd_test_~b#1|) (< |ULTIMATE.start_gcd_test_~b#1| (+ |c_ULTIMATE.start_main1_~x~0#1| 1))))) (let ((.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (or (and (let ((.cse2 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (let ((.cse1 (<= .cse2 127))) (or (and (not .cse1) (= .cse2 .cse3)) (and .cse1 (= .cse2 |c_ULTIMATE.start_gcd_test_~b#1|))))) (not .cse4)) (and .cse4 (or (and (let ((.cse6 (mod .cse8 |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse5 (= .cse6 0))) (or (and .cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse6 256))) (and (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (and (not .cse7) (= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse6) 256) .cse3)) (and .cse7 (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse6) 256) .cse3)))) (not .cse5))))) .cse9) (and .cse10 (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))) (or (and (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and .cse4 (or (and .cse9 (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= 0 (mod .cse8 |ULTIMATE.start_gcd_test_#res#1|)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (not (= |ULTIMATE.start_gcd_test_#res#1| 0))))) (and .cse10 (exists ((|ULTIMATE.start_gcd_test_#res#1| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= (mod (mod .cse11 |ULTIMATE.start_gcd_test_#res#1|) 256) 0) (not (= |ULTIMATE.start_gcd_test_#res#1| 0)))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) .cse0))))) is different from false [2022-12-14 09:19:55,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 09:19:57,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 09:19:59,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))) (and (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (< 127 |ULTIMATE.start_gcd_test_~b#1|) (< |ULTIMATE.start_gcd_test_~b#1| (+ |c_ULTIMATE.start_main1_~x~0#1| 1))))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) .cse0))) is different from false [2022-12-14 09:20:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:20:01,937 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-12-14 09:20:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:20:01,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 09:20:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:20:01,937 INFO L225 Difference]: With dead ends: 32 [2022-12-14 09:20:01,937 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 09:20:01,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=53, Invalid=194, Unknown=5, NotChecked=90, Total=342 [2022-12-14 09:20:01,939 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:20:01,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 3 Unknown, 27 Unchecked, 7.0s Time] [2022-12-14 09:20:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 09:20:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 09:20:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:20:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-12-14 09:20:01,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 7 [2022-12-14 09:20:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:20:01,944 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-12-14 09:20:01,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 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-12-14 09:20:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-12-14 09:20:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:20:01,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:20:01,945 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-12-14 09:20:01,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:20:02,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:20:02,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:20:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:20:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1587976524, now seen corresponding path program 2 times [2022-12-14 09:20:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:20:02,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781586535] [2022-12-14 09:20:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:20:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:20:02,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 09:20:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708424079] [2022-12-14 09:20:02,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:20:02,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:20:02,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:20:02,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:20:02,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:20:02,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 09:20:02,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:20:02,312 WARN L261 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 09:20:02,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:20:22,375 WARN L233 SmtUtils]: Spent 16.40s on a formula simplification. DAG size of input: 74 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:20:31,682 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse1 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (<= .cse10 127))) (let ((.cse12 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse6 (+ .cse10 (- 256))) (.cse8 (not .cse14)) (.cse15 (not .cse1)) (.cse19 (not .cse0))) (or (and .cse0 (or (and .cse1 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse2 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse7 (+ (- 256) .cse2))) (let ((.cse4 (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse2 127)) (= .cse3 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse4) 256)) (= .cse5 (mod (+ (mod .cse6 .cse7) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (not (= .cse4 0))))))) .cse8) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse9 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) .cse9))) (let ((.cse13 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse9 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse10 .cse11) 256)) (= (mod (+ .cse12 .cse13) 256) .cse3) (not (= .cse13 0))))))) .cse14 .cse15))) (and .cse15 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse16 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse17 (+ (- 256) .cse16))) (let ((.cse18 (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse16 127)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse17) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ .cse12 .cse18) 256) .cse3) (not (= .cse18 0))))))) .cse19) (and .cse1 .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse20 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (= .cse20 0)) (= .cse5 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse20) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))) .cse8) (and (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse22 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse23 (+ (- 256) .cse22))) (let ((.cse21 (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= .cse21 0) (not (<= .cse22 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse23) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))))) .cse19) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse25 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse26 (+ (- 256) .cse25))) (let ((.cse24 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= .cse24 0) (not (<= .cse25 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse10 .cse26) 256))))))) .cse14)) .cse15) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse29 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse29))) (let ((.cse28 (mod .cse30 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse27 (mod .cse6 .cse30))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (= .cse27 0)) (= .cse28 0) (not (<= .cse29 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256)) (= .cse5 (mod (+ .cse27 |ULTIMATE.start_gcd_test_#in~b#1|) 256))))))) .cse1 .cse0 .cse8) (and .cse15 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse19) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse10 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))) .cse0 .cse14)))))))) is different from false [2022-12-14 09:20:49,100 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse6 (not .cse1)) (.cse2 (<= .cse4 127)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse14 (< 127 .cse4)) (.cse0 (not .cse7)) (.cse32 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse4 (- 256)))) (or (and .cse0 (or (and .cse1 .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse3 (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= 0 .cse3)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse5) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))) .cse6))) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse8 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse13 (+ (- 256) .cse8))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse13))) (let ((.cse9 (mod .cse12 256))) (let ((.cse10 (mod .cse13 .cse9))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse8 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse9 0)) (not (= .cse10 0)) (= .cse11 (mod (+ .cse10 (* 255 .cse12)) 256))))))))) .cse6) (and (or (and .cse7 (or (and .cse14 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse17 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse20 (+ (- 256) .cse17))) (let ((.cse18 (mod .cse21 .cse20))) (let ((.cse19 (+ (mod (+ .cse18 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse15 (mod .cse20 .cse19)) (.cse16 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse15 0)) (= .cse16 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse17 127)) (= .cse11 (mod (+ .cse18 .cse15 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse16 256)))))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse24 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse24))) (let ((.cse25 (mod .cse4 .cse27))) (let ((.cse26 (mod .cse25 256))) (let ((.cse22 (mod .cse27 .cse26)) (.cse23 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse22 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= 0 .cse23) (not (<= .cse24 127)) (= .cse11 (mod (+ .cse22 (* .cse25 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse23 256)) (not (= .cse26 0))))))))) .cse2))) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse28 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse28))) (let ((.cse29 (mod .cse21 .cse30))) (let ((.cse31 (+ (mod (+ .cse29 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse33 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse28 127)) (= .cse11 (mod (+ .cse29 (mod .cse30 .cse31) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse32 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse33 0))))))))) (not .cse2)) (and .cse7 .cse2 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse35 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse38 (+ (- 256) .cse35))) (let ((.cse36 (mod .cse4 .cse38))) (let ((.cse37 (mod .cse36 256))) (let ((.cse34 (mod .cse38 .cse37))) (and (not (= .cse34 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse35 127)) (= .cse11 (mod (+ .cse34 (* .cse36 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse37 0))))))))))) .cse1) (and .cse1 .cse14 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse39 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse21 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse40 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse39) 256)) (= 0 .cse40) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse42 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse21 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse41 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse32 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse41) 256)) (not (= 0 .cse41)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse42) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))))))))))) is different from false [2022-12-14 09:20:51,118 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse6 (not .cse1)) (.cse2 (<= .cse4 127)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse14 (< 127 .cse4)) (.cse0 (not .cse7)) (.cse32 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse4 (- 256)))) (or (and .cse0 (or (and .cse1 .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse3 (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= 0 .cse3)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse5) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))) .cse6))) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse8 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse13 (+ (- 256) .cse8))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse13))) (let ((.cse9 (mod .cse12 256))) (let ((.cse10 (mod .cse13 .cse9))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse8 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse9 0)) (not (= .cse10 0)) (= .cse11 (mod (+ .cse10 (* 255 .cse12)) 256))))))))) .cse6) (and (or (and .cse7 (or (and .cse14 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse17 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse20 (+ (- 256) .cse17))) (let ((.cse18 (mod .cse21 .cse20))) (let ((.cse19 (+ (mod (+ .cse18 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse15 (mod .cse20 .cse19)) (.cse16 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse15 0)) (= .cse16 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse17 127)) (= .cse11 (mod (+ .cse18 .cse15 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse16 256)))))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse24 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse24))) (let ((.cse25 (mod .cse4 .cse27))) (let ((.cse26 (mod .cse25 256))) (let ((.cse22 (mod .cse27 .cse26)) (.cse23 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse22 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= 0 .cse23) (not (<= .cse24 127)) (= .cse11 (mod (+ .cse22 (* .cse25 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse23 256)) (not (= .cse26 0))))))))) .cse2))) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse28 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse28))) (let ((.cse29 (mod .cse21 .cse30))) (let ((.cse31 (+ (mod (+ .cse29 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse33 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse28 127)) (= .cse11 (mod (+ .cse29 (mod .cse30 .cse31) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse32 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse33 0))))))))) (not .cse2)) (and .cse7 .cse2 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse35 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse38 (+ (- 256) .cse35))) (let ((.cse36 (mod .cse4 .cse38))) (let ((.cse37 (mod .cse36 256))) (let ((.cse34 (mod .cse38 .cse37))) (and (not (= .cse34 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse35 127)) (= .cse11 (mod (+ .cse34 (* .cse36 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse37 0))))))))))) .cse1) (and .cse1 .cse14 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse39 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse21 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse40 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse39) 256)) (= 0 .cse40) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse42 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse21 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse41 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse32 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse41) 256)) (not (= 0 .cse41)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse42) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))))))))))) is different from true [2022-12-14 09:21:43,532 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (let ((.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse11 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse8 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse1 (<= .cse11 127)) (.cse2 (not .cse12)) (.cse0 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse13 (< 127 .cse11)) (.cse14 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse23 (+ .cse11 (- 256)))) (or (and .cse0 (or (and .cse1 .cse2 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse5 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse9 (+ (- 256) .cse5))) (let ((.cse10 (mod .cse11 .cse9))) (let ((.cse3 (mod .cse10 256))) (let ((.cse4 (+ (- 256) (mod (+ (mod .cse9 .cse3) (* .cse10 255)) 256)))) (let ((.cse6 (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse3 .cse4) 256)) (not (<= .cse5 127)) (not (= .cse6 0)) (= .cse7 (mod (+ .cse8 .cse6) 256))))))))))) (and .cse12 .cse13 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse19 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse22 (+ (- 256) .cse19))) (let ((.cse15 (mod .cse23 .cse22))) (let ((.cse20 (+ (mod (+ .cse15 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse16 (mod .cse22 .cse20))) (let ((.cse21 (+ (- 256) (mod (+ .cse15 .cse16 |ULTIMATE.start_gcd_test_#in~b#1|) 256)))) (let ((.cse18 (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse17 (mod .cse20 .cse21))) (and (= .cse14 (mod (+ .cse15 .cse16 .cse17 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse18 256)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse19 127)) (= .cse18 0) (not (= .cse17 0)))))))))))) (and .cse1 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse27 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse28 (+ (- 256) .cse27))) (let ((.cse29 (mod .cse11 .cse28))) (let ((.cse25 (mod .cse29 256))) (let ((.cse26 (+ (- 256) (mod (+ (mod .cse28 .cse25) (* .cse29 255)) 256)))) (let ((.cse24 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse25 .cse26) 256)) (not (<= .cse27 127)) (= .cse24 0))))))))) .cse2) (and .cse12 (not .cse1) (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse35 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse36 (+ (- 256) .cse35))) (let ((.cse30 (mod .cse23 .cse36))) (let ((.cse32 (+ (mod (+ .cse30 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse31 (mod .cse36 .cse32))) (let ((.cse33 (+ (- 256) (mod (+ .cse30 .cse31 |ULTIMATE.start_gcd_test_#in~b#1|) 256)))) (let ((.cse34 (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse14 (mod (+ .cse30 .cse31 (mod .cse32 .cse33) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (= .cse34 0)) (not (<= .cse35 127)) (= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse7))))))))))))) (and (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse38 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse41 (+ (- 256) .cse38))) (let ((.cse42 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse41))) (let ((.cse39 (mod .cse42 256))) (let ((.cse40 (+ (- 256) (mod (+ (mod .cse41 .cse39) (* 255 .cse42)) 256)))) (let ((.cse37 (mod .cse40 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse7 (mod (+ .cse8 .cse37) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse38 127)) (= (mod (mod .cse39 .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse37 0)))))))))) .cse2) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse44 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse47 (+ (- 256) .cse44))) (let ((.cse48 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse47))) (let ((.cse45 (mod .cse48 256))) (let ((.cse46 (+ (- 256) (mod (+ (mod .cse47 .cse45) (* 255 .cse48)) 256)))) (let ((.cse43 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse44 127)) (= (mod (mod .cse45 .cse46) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse43 0))))))))) .cse2)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse50 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse49 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse50) 256))) (and (not (= .cse49 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse50 .cse49) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (not .cse0)) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse51 (mod (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse52 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse51) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse51 .cse52) 256)) (not (= .cse52 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))))) .cse2) (and .cse12 .cse0 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse56 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse23 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse56))) (let ((.cse53 (mod .cse55 256))) (let ((.cse54 (mod .cse56 .cse53))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= .cse14 (mod (+ .cse54 (* .cse55 255)) 256)) (not (= .cse53 0)) (not (= .cse54 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-14 09:22:00,824 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse20 (< |c_ULTIMATE.start_main1_~g~0#1| 0)) (.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse13 (< 127 .cse2)) (.cse17 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse19 (+ .cse2 (- 256))) (.cse4 (<= .cse2 127)) (.cse7 (not .cse20)) (.cse3 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse0 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse0) 256))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse0 .cse1) 256)) (not (= .cse1 0)) (= (mod (mod .cse1 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) .cse3 .cse4) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse6) 256))) (and (not (= .cse5 0)) (= (mod (mod .cse6 .cse5) 256) |c_ULTIMATE.start_main1_~g~0#1|) (= (mod (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (not .cse3))) .cse7) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse10 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) .cse10))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse11))) (let ((.cse9 (mod .cse12 256))) (let ((.cse8 (+ (- 256) (mod (+ (mod .cse11 .cse9) (* 255 .cse12)) 256)))) (and (= (mod .cse8 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod .cse9 .cse8) 256) |c_ULTIMATE.start_main1_~g~0#1|) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse10 127))))))))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and .cse3 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse18 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse19 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse18))) (let ((.cse14 (mod .cse16 256))) (let ((.cse15 (mod .cse18 .cse14))) (and (= (mod (mod .cse14 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (not (= .cse14 0)) (not (= .cse15 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127) (= (mod (+ .cse15 (* .cse16 255)) 256) .cse17))))))) .cse20) (and (or (and .cse13 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse22 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse22))) (let ((.cse23 (mod .cse19 .cse27))) (let ((.cse26 (+ (mod (+ .cse23 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse24 (mod .cse27 .cse26))) (let ((.cse21 (+ (- 256) (mod (+ .cse23 .cse24 |ULTIMATE.start_gcd_test_#in~b#1|) 256)))) (let ((.cse25 (mod .cse26 .cse21))) (and (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse22 127)) (= .cse17 (mod (+ .cse23 .cse24 .cse25 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (not (= .cse25 0))))))))))) .cse20) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse30 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse31 (+ (- 256) .cse30))) (let ((.cse32 (mod .cse2 .cse31))) (let ((.cse28 (mod .cse32 256))) (let ((.cse29 (+ (- 256) (mod (+ (mod .cse31 .cse28) (* .cse32 255)) 256)))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse28 .cse29) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse30 127)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))))))) .cse4 .cse7)) .cse3))))) is different from false [2022-12-14 09:22:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-14 09:22:03,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:25:09,854 WARN L233 SmtUtils]: Spent 2.75m on a formula simplification. DAG size of input: 86 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:26:05,323 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse18 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse18 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse28 (+ (- 256) .cse26))) (let ((.cse14 (<= .cse26 127)) (.cse17 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse25 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (.cse19 (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (.cse27 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256)) (.cse15 (mod .cse18 256))) (let ((.cse0 (<= .cse15 127)) (.cse12 (not (= (mod (mod .cse28 .cse27) 256) 0))) (.cse13 (<= .cse27 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (not .cse19)) (.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (= .cse26 0)) (.cse6 (not (= (mod (mod .cse26 .cse25) 256) 0))) (.cse7 (not .cse17)) (.cse8 (<= .cse25 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse10 (not .cse14))) (and (or (not .cse0) (let ((.cse4 (= .cse18 0)) (.cse9 (let ((.cse16 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256))) (or (not (= (mod (mod .cse15 .cse16) 256) 0)) .cse17 (<= .cse16 |c_ULTIMATE.start_main1_~x~0#1|) (= .cse15 0))))) (and (or (let ((.cse1 (and (or .cse4 .cse5 .cse6 .cse7 .cse8) .cse9))) (and (or .cse1 .cse2) (or .cse1 .cse2 .cse3))) .cse10) (or (let ((.cse11 (and (or .cse4 .cse12 .cse7 .cse13) .cse9))) (and (or .cse11 .cse2 .cse3) (or .cse11 .cse2))) .cse14)))) (or .cse0 (let ((.cse21 (let ((.cse23 (+ (- 256) .cse15))) (let ((.cse24 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse23) 256))) (or .cse17 (not (= 0 (mod (mod .cse23 .cse24) 256))) (<= .cse24 |c_ULTIMATE.start_main1_~x~0#1|)))))) (and (or .cse14 (let ((.cse20 (and .cse21 (or .cse12 .cse7 .cse13)))) (and (or .cse2 .cse19 .cse20) (or .cse2 .cse3 .cse20)))) (or (let ((.cse22 (and .cse21 (or .cse5 .cse6 .cse7 .cse8)))) (and (or .cse2 .cse3 .cse22) (or .cse2 .cse19 .cse22))) .cse10)))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-12-14 09:26:07,333 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse18 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse18 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse28 (+ (- 256) .cse26))) (let ((.cse14 (<= .cse26 127)) (.cse17 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse25 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse26) 256)) (.cse19 (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (.cse27 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256)) (.cse15 (mod .cse18 256))) (let ((.cse0 (<= .cse15 127)) (.cse12 (not (= (mod (mod .cse28 .cse27) 256) 0))) (.cse13 (<= .cse27 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (not .cse19)) (.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (= .cse26 0)) (.cse6 (not (= (mod (mod .cse26 .cse25) 256) 0))) (.cse7 (not .cse17)) (.cse8 (<= .cse25 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse10 (not .cse14))) (and (or (not .cse0) (let ((.cse4 (= .cse18 0)) (.cse9 (let ((.cse16 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256))) (or (not (= (mod (mod .cse15 .cse16) 256) 0)) .cse17 (<= .cse16 |c_ULTIMATE.start_main1_~x~0#1|) (= .cse15 0))))) (and (or (let ((.cse1 (and (or .cse4 .cse5 .cse6 .cse7 .cse8) .cse9))) (and (or .cse1 .cse2) (or .cse1 .cse2 .cse3))) .cse10) (or (let ((.cse11 (and (or .cse4 .cse12 .cse7 .cse13) .cse9))) (and (or .cse11 .cse2 .cse3) (or .cse11 .cse2))) .cse14)))) (or .cse0 (let ((.cse21 (let ((.cse23 (+ (- 256) .cse15))) (let ((.cse24 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse23) 256))) (or .cse17 (not (= 0 (mod (mod .cse23 .cse24) 256))) (<= .cse24 |c_ULTIMATE.start_main1_~x~0#1|)))))) (and (or .cse14 (let ((.cse20 (and .cse21 (or .cse12 .cse7 .cse13)))) (and (or .cse2 .cse19 .cse20) (or .cse2 .cse3 .cse20)))) (or (let ((.cse22 (and .cse21 (or .cse5 .cse6 .cse7 .cse8)))) (and (or .cse2 .cse3 .cse22) (or .cse2 .cse19 .cse22))) .cse10)))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-12-14 09:29:59,021 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse20 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse38 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse37 (mod (+ .cse20 .cse38) 256)) (.cse28 (* .cse20 255)) (.cse36 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse34 (+ (mod (+ .cse28 .cse38 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse36)) 256) (- 256))) (.cse32 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse37) 256))) (let ((.cse31 (<= .cse37 127)) (.cse14 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse33 (mod (mod .cse37 .cse32) 256)) (.cse8 (<= .cse36 127)) (.cse35 (mod (mod .cse36 .cse34) 256)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse27 (mod .cse20 256))) (let ((.cse30 (<= .cse27 127)) (.cse10 (not .cse7)) (.cse12 (<= .cse35 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse13 (not (= (mod (mod .cse34 .cse35) 256) 0))) (.cse9 (not .cse8)) (.cse2 (= .cse32 0)) (.cse4 (<= .cse33 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (not .cse14)) (.cse6 (not (= (mod (mod .cse32 .cse33) 256) 0))) (.cse18 (not .cse31))) (and (or (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27))) (let ((.cse25 (mod .cse29 256)) (.cse24 (+ (mod (+ .cse28 .cse29) 256) (- 256)))) (let ((.cse23 (mod (mod .cse27 .cse24) 256)) (.cse26 (mod (mod .cse27 .cse25) 256))) (let ((.cse15 (= .cse25 0)) (.cse16 (<= .cse26 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse17 (not (= (mod (mod .cse25 .cse26) 256) 0))) (.cse21 (not (= (mod (mod .cse24 .cse23) 256) 0))) (.cse22 (<= .cse23 |c_ULTIMATE.start_main1_~x~0#1|))) (let ((.cse0 (or .cse14 .cse10 .cse21 .cse22)) (.cse11 (or .cse14 .cse21 .cse22)) (.cse3 (= .cse20 0)) (.cse19 (or .cse14 .cse7 .cse15 .cse16 .cse17))) (and (or (let ((.cse1 (or .cse14 .cse15 .cse16 .cse17))) (and (or (and .cse0 (or (and .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6)) .cse7)) .cse8) (or .cse9 (and (or (and (or .cse2 .cse4 .cse5 .cse6) .cse1) .cse7) (or .cse10 (and .cse11 (or .cse12 .cse5 .cse13))))))) .cse18) (or (and .cse0 .cse19) .cse8) (or .cse9 (and (or .cse10 (and .cse11 (or .cse3 .cse12 .cse5 .cse13))) .cse19)))))))) (not .cse30)) (or .cse30 (and (or .cse10 .cse12 .cse31 .cse9 .cse5 .cse13) (or (and (or (and (or .cse2 .cse4 .cse7 .cse5 .cse6) (or .cse10 .cse12 .cse5 .cse13)) .cse9) (or .cse2 .cse4 .cse7 .cse8 .cse5 .cse6)) .cse18))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-12-14 09:29:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-14 09:29:59,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:29:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781586535] [2022-12-14 09:29:59,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 09:29:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708424079] [2022-12-14 09:29:59,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708424079] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:29:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1458872787] [2022-12-14 09:29:59,169 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 09:29:59,169 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:29:59,169 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:29:59,169 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:29:59,169 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:29:59,308 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:30:02,324 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '336#(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_main1_~x~0#1|) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~x~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)) (= |#NULL.base| 0))' at error location [2022-12-14 09:30:02,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:30:02,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:30:02,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-12-14 09:30:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4143559] [2022-12-14 09:30:02,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:30:02,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 09:30:02,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:30:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 09:30:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=167, Unknown=9, NotChecked=186, Total=420 [2022-12-14 09:30:02,327 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-12-14 09:30:06,408 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse0 127)) (= .cse0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)))))) (or (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse39 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse38 (mod (+ .cse21 .cse39) 256)) (.cse29 (* .cse21 255)) (.cse37 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse35 (+ (mod (+ .cse29 .cse39 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse37)) 256) (- 256))) (.cse33 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse38) 256))) (let ((.cse32 (<= .cse38 127)) (.cse15 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse34 (mod (mod .cse38 .cse33) 256)) (.cse9 (<= .cse37 127)) (.cse36 (mod (mod .cse37 .cse35) 256)) (.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse28 (mod .cse21 256))) (let ((.cse31 (<= .cse28 127)) (.cse11 (not .cse8)) (.cse13 (<= .cse36 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse14 (not (= (mod (mod .cse35 .cse36) 256) 0))) (.cse10 (not .cse9)) (.cse3 (= .cse33 0)) (.cse5 (<= .cse34 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (not .cse15)) (.cse7 (not (= (mod (mod .cse33 .cse34) 256) 0))) (.cse19 (not .cse32))) (and (or (let ((.cse30 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28))) (let ((.cse26 (mod .cse30 256)) (.cse25 (+ (mod (+ .cse29 .cse30) 256) (- 256)))) (let ((.cse24 (mod (mod .cse28 .cse25) 256)) (.cse27 (mod (mod .cse28 .cse26) 256))) (let ((.cse16 (= .cse26 0)) (.cse17 (<= .cse27 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse18 (not (= (mod (mod .cse26 .cse27) 256) 0))) (.cse22 (not (= (mod (mod .cse25 .cse24) 256) 0))) (.cse23 (<= .cse24 |c_ULTIMATE.start_main1_~x~0#1|))) (let ((.cse1 (or .cse15 .cse11 .cse22 .cse23)) (.cse12 (or .cse15 .cse22 .cse23)) (.cse4 (= .cse21 0)) (.cse20 (or .cse15 .cse8 .cse16 .cse17 .cse18))) (and (or (let ((.cse2 (or .cse15 .cse16 .cse17 .cse18))) (and (or (and .cse1 (or (and .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8)) .cse9) (or .cse10 (and (or (and (or .cse3 .cse5 .cse6 .cse7) .cse2) .cse8) (or .cse11 (and .cse12 (or .cse13 .cse6 .cse14))))))) .cse19) (or (and .cse1 .cse20) .cse9) (or .cse10 (and (or .cse11 (and .cse12 (or .cse4 .cse13 .cse6 .cse14))) .cse20)))))))) (not .cse31)) (or .cse31 (and (or .cse11 .cse13 .cse32 .cse10 .cse6 .cse14) (or (and (or (and (or .cse3 .cse5 .cse8 .cse6 .cse7) (or .cse11 .cse13 .cse6 .cse14)) .cse10) (or .cse3 .cse5 .cse8 .cse9 .cse6 .cse7)) .cse19))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (let ((.cse40 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (and (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (not .cse40)) (and .cse40 (let ((.cse42 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse41 (<= .cse42 127))) (or (and (not .cse41) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse42)) (and (= .cse42 |c_ULTIMATE.start_gcd_test_~a#1|) .cse41)))))))) is different from true [2022-12-14 09:30:08,419 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse0 127)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse0)))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse1)) (and .cse1 (let ((.cse3 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= .cse3 127))) (or (and .cse2 (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse4 (= .cse5 0))) (or (and .cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 256))) (and (= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse5) 256) (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (not .cse4))))) (not .cse2)))))))) (or (let ((.cse24 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ .cse24 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse34 (+ (- 256) .cse32))) (let ((.cse20 (<= .cse32 127)) (.cse23 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse31 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse32) 256)) (.cse25 (<= (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (.cse33 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256)) (.cse21 (mod .cse24 256))) (let ((.cse6 (<= .cse21 127)) (.cse18 (not (= (mod (mod .cse34 .cse33) 256) 0))) (.cse19 (<= .cse33 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse9 (not .cse25)) (.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (= .cse32 0)) (.cse12 (not (= (mod (mod .cse32 .cse31) 256) 0))) (.cse13 (not .cse23)) (.cse14 (<= .cse31 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse16 (not .cse20))) (and (or (not .cse6) (let ((.cse10 (= .cse24 0)) (.cse15 (let ((.cse22 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse21) 256))) (or (not (= (mod (mod .cse21 .cse22) 256) 0)) .cse23 (<= .cse22 |c_ULTIMATE.start_main1_~x~0#1|) (= .cse21 0))))) (and (or (let ((.cse7 (and (or .cse10 .cse11 .cse12 .cse13 .cse14) .cse15))) (and (or .cse7 .cse8) (or .cse7 .cse8 .cse9))) .cse16) (or (let ((.cse17 (and (or .cse10 .cse18 .cse13 .cse19) .cse15))) (and (or .cse17 .cse8 .cse9) (or .cse17 .cse8))) .cse20)))) (or .cse6 (let ((.cse27 (let ((.cse29 (+ (- 256) .cse21))) (let ((.cse30 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256))) (or .cse23 (not (= 0 (mod (mod .cse29 .cse30) 256))) (<= .cse30 |c_ULTIMATE.start_main1_~x~0#1|)))))) (and (or .cse20 (let ((.cse26 (and .cse27 (or .cse18 .cse13 .cse19)))) (and (or .cse8 .cse25 .cse26) (or .cse8 .cse9 .cse26)))) (or (let ((.cse28 (and .cse27 (or .cse11 .cse12 .cse13 .cse14)))) (and (or .cse8 .cse9 .cse28) (or .cse8 .cse25 .cse28))) .cse16)))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-14 09:30:11,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 09:30:13,682 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|))) (.cse6 (not .cse8))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or .cse0 .cse1 (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse14 256)) (.cse16 (mod (+ .cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0))) (.cse3 (not .cse11)) (.cse5 (not (<= .cse17 127))) (.cse7 (<= .cse17 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse10 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0))) (.cse12 (<= .cse16 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse13 (not (<= .cse16 127))) (.cse15 (<= .cse9 127))) (and (or (let ((.cse4 (= .cse14 0))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 (<= .cse9 |c_ULTIMATE.start_main1_~x~0#1|) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0))) (or .cse4 .cse10 .cse11 .cse6 .cse12 .cse13))) (not .cse15)) (or (and (or .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse10 .cse11 .cse6 .cse12 .cse13)) .cse15)))))) (or (<= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (not .cse1) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) .cse0) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse27 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse18 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse31 (<= .cse27 127))) (let ((.cse29 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse20 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse22 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse23 (+ .cse27 (- 256))) (.cse25 (not .cse31)) (.cse35 (not .cse18))) (or (and .cse18 (or (and .cse8 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse19 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse24 (+ (- 256) .cse19))) (let ((.cse21 (mod .cse24 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse19 127)) (= .cse20 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse21) 256)) (= .cse22 (mod (+ (mod .cse23 .cse24) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (not (= .cse21 0))))))) .cse25) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse26 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse28 (+ (- 256) .cse26))) (let ((.cse30 (mod .cse28 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse26 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse27 .cse28) 256)) (= (mod (+ .cse29 .cse30) 256) .cse20) (not (= .cse30 0))))))) .cse31 .cse6))) (and .cse6 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse32 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse33 (+ (- 256) .cse32))) (let ((.cse34 (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse32 127)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse33) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ .cse29 .cse34) 256) .cse20) (not (= .cse34 0))))))) .cse35) (and .cse8 .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse36 (mod .cse23 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (not (= .cse36 0)) (= .cse22 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) .cse36) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))) .cse25) (and (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse38 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse39 (+ (- 256) .cse38))) (let ((.cse37 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= .cse37 0) (not (<= .cse38 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse37 256)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse39) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))))) .cse35) (and .cse18 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse41 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse42 (+ (- 256) .cse41))) (let ((.cse40 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= .cse40 0) (not (<= .cse41 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse27 .cse42) 256))))))) .cse31)) .cse6) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse45 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse46 (+ (- 256) .cse45))) (let ((.cse44 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse43 (mod .cse23 .cse46))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (= .cse43 0)) (= .cse44 0) (not (<= .cse45 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse44 256)) (= .cse22 (mod (+ .cse43 |ULTIMATE.start_gcd_test_#in~b#1|) 256))))))) .cse8 .cse18 .cse25) (and .cse6 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) .cse35) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse27 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))) .cse18 .cse31)))))))))) is different from false [2022-12-14 09:30:15,800 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256)) (.cse1 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse6 (not .cse1)) (.cse2 (<= .cse4 127)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse14 (< 127 .cse4)) (.cse0 (not .cse7)) (.cse32 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse4 (- 256)))) (or (and .cse0 (or (and .cse1 .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse3 (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= 0 .cse3)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse5) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))) .cse6))) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse8 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse13 (+ (- 256) .cse8))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse13))) (let ((.cse9 (mod .cse12 256))) (let ((.cse10 (mod .cse13 .cse9))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse8 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse9 0)) (not (= .cse10 0)) (= .cse11 (mod (+ .cse10 (* 255 .cse12)) 256))))))))) .cse6) (and (or (and .cse7 (or (and .cse14 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse17 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse20 (+ (- 256) .cse17))) (let ((.cse18 (mod .cse21 .cse20))) (let ((.cse19 (+ (mod (+ .cse18 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse15 (mod .cse20 .cse19)) (.cse16 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse15 0)) (= .cse16 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse17 127)) (= .cse11 (mod (+ .cse18 .cse15 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse16 256)))))))))) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse24 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse24))) (let ((.cse25 (mod .cse4 .cse27))) (let ((.cse26 (mod .cse25 256))) (let ((.cse22 (mod .cse27 .cse26)) (.cse23 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse22 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= 0 .cse23) (not (<= .cse24 127)) (= .cse11 (mod (+ .cse22 (* .cse25 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse23 256)) (not (= .cse26 0))))))))) .cse2))) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse28 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse30 (+ (- 256) .cse28))) (let ((.cse29 (mod .cse21 .cse30))) (let ((.cse31 (+ (mod (+ .cse29 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse33 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse28 127)) (= .cse11 (mod (+ .cse29 (mod .cse30 .cse31) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse32 (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse33 0))))))))) (not .cse2)) (and .cse7 .cse2 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse35 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse38 (+ (- 256) .cse35))) (let ((.cse36 (mod .cse4 .cse38))) (let ((.cse37 (mod .cse36 256))) (let ((.cse34 (mod .cse38 .cse37))) (and (not (= .cse34 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse35 127)) (= .cse11 (mod (+ .cse34 (* .cse36 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse37 0))))))))))) .cse1) (and .cse1 .cse14 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse39 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse21 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse40 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse39) 256)) (= 0 .cse40) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) .cse0) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse42 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse21 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse41 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse32 (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse41) 256)) (not (= 0 .cse41)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse42) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127)))))))))))) is different from false [2022-12-14 09:30:17,826 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (let ((.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse11 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse8 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse1 (<= .cse11 127)) (.cse2 (not .cse12)) (.cse0 (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (.cse13 (< 127 .cse11)) (.cse14 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse23 (+ .cse11 (- 256)))) (or (and .cse0 (or (and .cse1 .cse2 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse5 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse9 (+ (- 256) .cse5))) (let ((.cse10 (mod .cse11 .cse9))) (let ((.cse3 (mod .cse10 256))) (let ((.cse4 (+ (- 256) (mod (+ (mod .cse9 .cse3) (* .cse10 255)) 256)))) (let ((.cse6 (mod .cse4 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse3 .cse4) 256)) (not (<= .cse5 127)) (not (= .cse6 0)) (= .cse7 (mod (+ .cse8 .cse6) 256))))))))))) (and .cse12 .cse13 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse19 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse22 (+ (- 256) .cse19))) (let ((.cse15 (mod .cse23 .cse22))) (let ((.cse20 (+ (mod (+ .cse15 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse16 (mod .cse22 .cse20))) (let ((.cse21 (+ (- 256) (mod (+ .cse15 .cse16 |ULTIMATE.start_gcd_test_#in~b#1|) 256)))) (let ((.cse18 (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse17 (mod .cse20 .cse21))) (and (= .cse14 (mod (+ .cse15 .cse16 .cse17 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse18 256)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse19 127)) (= .cse18 0) (not (= .cse17 0)))))))))))) (and .cse1 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse27 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse28 (+ (- 256) .cse27))) (let ((.cse29 (mod .cse11 .cse28))) (let ((.cse25 (mod .cse29 256))) (let ((.cse26 (+ (- 256) (mod (+ (mod .cse28 .cse25) (* .cse29 255)) 256)))) (let ((.cse24 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse25 .cse26) 256)) (not (<= .cse27 127)) (= .cse24 0))))))))) .cse2) (and .cse12 (not .cse1) (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse35 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse36 (+ (- 256) .cse35))) (let ((.cse30 (mod .cse23 .cse36))) (let ((.cse32 (+ (mod (+ .cse30 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse31 (mod .cse36 .cse32))) (let ((.cse33 (+ (- 256) (mod (+ .cse30 .cse31 |ULTIMATE.start_gcd_test_#in~b#1|) 256)))) (let ((.cse34 (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse14 (mod (+ .cse30 .cse31 (mod .cse32 .cse33) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (= .cse34 0)) (not (<= .cse35 127)) (= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse7))))))))))))) (and (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse38 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse41 (+ (- 256) .cse38))) (let ((.cse42 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse41))) (let ((.cse39 (mod .cse42 256))) (let ((.cse40 (+ (- 256) (mod (+ (mod .cse41 .cse39) (* 255 .cse42)) 256)))) (let ((.cse37 (mod .cse40 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse7 (mod (+ .cse8 .cse37) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse38 127)) (= (mod (mod .cse39 .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse37 0)))))))))) .cse2) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse44 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse47 (+ (- 256) .cse44))) (let ((.cse48 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse47))) (let ((.cse45 (mod .cse48 256))) (let ((.cse46 (+ (- 256) (mod (+ (mod .cse47 .cse45) (* 255 .cse48)) 256)))) (let ((.cse43 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse44 127)) (= (mod (mod .cse45 .cse46) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse43 0))))))))) .cse2)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse50 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse49 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse50) 256))) (and (not (= .cse49 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse50 .cse49) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (not .cse0)) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse51 (mod (mod .cse11 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse52 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse51) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse51 .cse52) 256)) (not (= .cse52 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))))) .cse2) (and .cse12 .cse0 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse56 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse23 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse56))) (let ((.cse53 (mod .cse55 256))) (let ((.cse54 (mod .cse56 .cse53))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= .cse14 (mod (+ .cse54 (* .cse55 255)) 256)) (not (= .cse53 0)) (not (= .cse54 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))))))))) (or (<= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-14 09:30:19,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 09:30:21,897 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse20 (< |c_ULTIMATE.start_main1_~g~0#1| 0)) (.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse13 (< 127 .cse2)) (.cse17 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse19 (+ .cse2 (- 256))) (.cse4 (<= .cse2 127)) (.cse7 (not .cse20)) (.cse3 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse0 (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse0) 256))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse0 .cse1) 256)) (not (= .cse1 0)) (= (mod (mod .cse1 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) .cse3 .cse4) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_27|) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse6) 256))) (and (not (= .cse5 0)) (= (mod (mod .cse6 .cse5) 256) |c_ULTIMATE.start_main1_~g~0#1|) (= (mod (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127))))) (not .cse3))) .cse7) (and .cse7 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse10 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse11 (+ (- 256) .cse10))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse11))) (let ((.cse9 (mod .cse12 256))) (let ((.cse8 (+ (- 256) (mod (+ (mod .cse11 .cse9) (* 255 .cse12)) 256)))) (and (= (mod .cse8 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod .cse9 .cse8) 256) |c_ULTIMATE.start_main1_~g~0#1|) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse10 127))))))))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and .cse3 .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (let ((.cse18 (+ (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_27|) (mod .cse19 |v_ULTIMATE.start_gcd_test_~a#1_27|)) 256) (- 256)))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse18))) (let ((.cse14 (mod .cse16 256))) (let ((.cse15 (mod .cse18 .cse14))) (and (= (mod (mod .cse14 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (not (= .cse14 0)) (not (= .cse15 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (<= |v_ULTIMATE.start_gcd_test_~a#1_27| 127) (= (mod (+ .cse15 (* .cse16 255)) 256) .cse17))))))) .cse20) (and (or (and .cse13 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse22 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse27 (+ (- 256) .cse22))) (let ((.cse23 (mod .cse19 .cse27))) (let ((.cse26 (+ (mod (+ .cse23 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse24 (mod .cse27 .cse26))) (let ((.cse21 (+ (- 256) (mod (+ .cse23 .cse24 |ULTIMATE.start_gcd_test_#in~b#1|) 256)))) (let ((.cse25 (mod .cse26 .cse21))) (and (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse22 127)) (= .cse17 (mod (+ .cse23 .cse24 .cse25 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (not (= .cse25 0))))))))))) .cse20) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse30 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse31 (+ (- 256) .cse30))) (let ((.cse32 (mod .cse2 .cse31))) (let ((.cse28 (mod .cse32 256))) (let ((.cse29 (+ (- 256) (mod (+ (mod .cse31 .cse28) (* .cse32 255)) 256)))) (and (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod .cse28 .cse29) 256)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse30 127)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))))))) .cse4 .cse7)) .cse3)))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~x~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))) is different from false [2022-12-14 09:30:23,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 09:30:54,895 WARN L233 SmtUtils]: Spent 26.27s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:30:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:30:55,773 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-12-14 09:30:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 09:30:55,775 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 09:30:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:30:55,776 INFO L225 Difference]: With dead ends: 29 [2022-12-14 09:30:55,776 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 09:30:55,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 253.0s TimeCoverageRelationStatistics Valid=79, Invalid=194, Unknown=15, NotChecked=468, Total=756 [2022-12-14 09:30:55,777 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:30:55,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 1 Unknown, 96 Unchecked, 8.1s Time] [2022-12-14 09:30:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 09:30:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 09:30:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:30:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-12-14 09:30:55,789 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2022-12-14 09:30:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:30:55,789 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-12-14 09:30:55,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-12-14 09:30:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-12-14 09:30:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 09:30:55,790 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:30:55,790 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2022-12-14 09:30:55,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 09:30:55,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:30:55,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:30:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:30:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1916224945, now seen corresponding path program 3 times [2022-12-14 09:30:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:30:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175491716] [2022-12-14 09:30:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:30:55,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:30:56,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 09:30:56,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943409410] [2022-12-14 09:30:56,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:30:56,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:30:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:30:56,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:30:56,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13143d3-358d-4f88-9925-7c201dd44b54/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:30:56,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:30:56,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:30:56,169 WARN L261 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 09:30:56,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:31:18,019 WARN L233 SmtUtils]: Spent 17.12s on a formula simplification. DAG size of input: 79 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:31:36,210 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse7 (<= .cse2 127)) (.cse14 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse4 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse6 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse22 (not .cse0)) (.cse8 (not .cse14)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse12 (+ .cse2 (- 256))) (.cse15 (not .cse7))) (or (and .cse0 (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse3 (+ (- 256) .cse1))) (let ((.cse5 (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse1 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse2 .cse3) 256)) (= (mod (+ .cse4 .cse5) 256) .cse6) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse5) 256) 127))))))) .cse7 .cse8) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse10 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse13 (+ (- 256) .cse10))) (let ((.cse9 (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse4 .cse9) 256) 127)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse10 127)) (= .cse6 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse9) 256)) (= .cse11 (mod (+ (mod .cse12 .cse13) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (not (= .cse9 0))))))) .cse14 .cse15))) (and .cse14 .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse16 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse16))) (let ((.cse17 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse16 127)) (= .cse6 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse17) 256)) (<= (mod (+ .cse4 .cse17) 256) 127) (= .cse11 (mod (+ (mod .cse12 .cse18) |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (not (= .cse17 0))))))) .cse15) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse19 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse20 (+ (- 256) .cse19))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse19 127)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse20) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ .cse4 .cse21) 256) .cse6) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse21) 256) 127))))))) .cse8 .cse22) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~a#1_38| 0)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_38|) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|))) .cse22) (and .cse0 (or (and .cse14 .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse23 (mod .cse12 |v_ULTIMATE.start_gcd_test_~a#1_38|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~a#1_38| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (not (= .cse23 0)) (= .cse11 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_38|) .cse23) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~a#1_38| 0)) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse2 |v_ULTIMATE.start_gcd_test_~a#1_38|) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|))) .cse7 .cse8))) (and (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse25 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse26 (+ (- 256) .cse25))) (let ((.cse24 (mod .cse26 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256) 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse25 127)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse26) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod (+ .cse4 .cse24) 256) .cse6) (not (= .cse24 0))))))) .cse22) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse28 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse29 (+ (- 256) .cse28))) (let ((.cse27 (mod .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse27) 256) 127) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse28 127)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse2 .cse29) 256)) (= (mod (+ .cse4 .cse27) 256) .cse6) (not (= .cse27 0))))))) .cse7)) .cse8) (and (or (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse31 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse32 (+ (- 256) .cse31))) (let ((.cse30 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= .cse30 0) (not (<= .cse31 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse30 256)) (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse32) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))))) .cse22) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse34 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse35 (+ (- 256) .cse34))) (let ((.cse33 (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (= .cse33 0) (not (<= .cse34 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse2 .cse35) 256))))))) .cse7)) .cse8) (and (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse38 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse39 (+ (- 256) .cse38))) (let ((.cse37 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse36 (mod .cse12 .cse39))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (= .cse36 0)) (= .cse37 0) (not (<= .cse38 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse37 256)) (= .cse11 (mod (+ .cse36 |ULTIMATE.start_gcd_test_#in~b#1|) 256))))))) .cse14 .cse0 .cse15))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-14 09:33:33,841 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse15 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256)) (.cse8 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (not .cse8)) (.cse28 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse24 (+ .cse15 (- 256))) (.cse16 (< 127 .cse15)) (.cse9 (<= .cse15 127)) (.cse52 (not .cse0))) (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse6 (+ (- 256) .cse1))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6))) (let ((.cse2 (mod .cse4 256))) (let ((.cse3 (mod .cse6 .cse2))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse1 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse2 0)) (not (<= (mod (+ .cse3 .cse4) 256) 127)) (= .cse5 (mod (+ .cse3 (* 255 .cse4)) 256))))))))) .cse7) (and .cse8 (or (and .cse0 .cse9 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse12 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse14 (+ (- 256) .cse12))) (let ((.cse11 (mod .cse15 .cse14))) (let ((.cse13 (mod .cse11 256))) (let ((.cse10 (mod .cse14 .cse13))) (and (not (<= (mod (+ .cse10 .cse11) 256) 127)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse12 127)) (= .cse5 (mod (+ .cse10 (* .cse11 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse13 0)))))))))) (and .cse16 (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse21 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse19 (mod .cse21 256))) (let ((.cse22 (+ (- 256) .cse19))) (let ((.cse20 (mod .cse24 .cse22))) (let ((.cse23 (+ (mod (+ .cse20 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse18 (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse17 (mod .cse22 .cse23))) (and (not (= .cse17 0)) (= .cse18 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse19 127)) (= .cse5 (mod (+ .cse20 .cse17 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse18 256)) (not (<= (mod (+ .cse21 .cse17 (* .cse20 255)) 256) 127))))))))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse30 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse25 (mod .cse30 256))) (let ((.cse31 (+ (- 256) .cse25))) (let ((.cse26 (mod .cse24 .cse31))) (let ((.cse32 (+ (mod (+ .cse26 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse29 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse27 (mod .cse31 .cse32))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse25 127)) (= .cse5 (mod (+ .cse26 .cse27 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse28 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse29 0)) (not (<= (mod (+ .cse30 .cse27 (* .cse26 255)) 256) 127))))))))))))))) (and (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse37 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse35 (mod .cse37 256))) (let ((.cse38 (+ (- 256) .cse35))) (let ((.cse36 (mod .cse24 .cse38))) (let ((.cse39 (+ (mod (+ .cse36 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse34 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse33 (mod .cse38 .cse39))) (and (not (= .cse33 0)) (= .cse34 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse35 127)) (= .cse5 (mod (+ .cse36 .cse33 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse34 256)) (<= (mod (+ .cse37 .cse33 (* .cse36 255)) 256) 127)))))))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse44 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse40 (mod .cse44 256))) (let ((.cse45 (+ (- 256) .cse40))) (let ((.cse41 (mod .cse24 .cse45))) (let ((.cse46 (+ (mod (+ .cse41 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse43 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse42 (mod .cse45 .cse46))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse40 127)) (= .cse5 (mod (+ .cse41 .cse42 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse28 (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse43 0)) (<= (mod (+ .cse44 .cse42 (* .cse41 255)) 256) 127))))))))))) .cse8 .cse16) (and .cse0 .cse8 .cse9 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse49 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse51 (+ (- 256) .cse49))) (let ((.cse48 (mod .cse15 .cse51))) (let ((.cse50 (mod .cse48 256))) (let ((.cse47 (mod .cse51 .cse50))) (and (not (= .cse47 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= (mod (+ .cse47 .cse48) 256) 127) (not (<= .cse49 127)) (= .cse5 (mod (+ .cse47 (* .cse48 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse50 0)))))))))) (and .cse52 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse53 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_38|) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (not (= .cse53 0)) (= (mod (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse53) 256))))) .cse7) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse54 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse58 (+ (- 256) .cse54))) (let ((.cse57 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse58))) (let ((.cse59 (mod .cse57 256))) (let ((.cse55 (mod .cse59 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse56 (mod .cse58 .cse59))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse54 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse55 256)) (<= (mod (+ .cse56 .cse57) 256) 127) (not (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (= .cse56 0)) (= .cse5 (mod (+ .cse56 (* 255 .cse57)) 256))))))))) .cse7) (and .cse8 (or (and (or (and .cse52 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse61 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_38|) (mod .cse24 |v_ULTIMATE.start_gcd_test_~a#1_38|)) 256)))) (let ((.cse60 (mod .cse61 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse60) 256) .cse28) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (not (= .cse60 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse61) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|)))))) (and .cse52 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse63 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_38|) (mod .cse24 |v_ULTIMATE.start_gcd_test_~a#1_38|)) 256)))) (let ((.cse62 (mod .cse63 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse62 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse63) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|))))))) .cse16) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse64 (mod (mod .cse15 |v_ULTIMATE.start_gcd_test_~a#1_38|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse64 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse64) 256)) (not (= .cse64 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|)))) .cse9 .cse52)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-12-14 09:33:35,856 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse15 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256)) (.cse8 (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (let ((.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (not .cse8)) (.cse28 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse24 (+ .cse15 (- 256))) (.cse16 (< 127 .cse15)) (.cse9 (<= .cse15 127)) (.cse52 (not .cse0))) (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse6 (+ (- 256) .cse1))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6))) (let ((.cse2 (mod .cse4 256))) (let ((.cse3 (mod .cse6 .cse2))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse1 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse2 0)) (not (<= (mod (+ .cse3 .cse4) 256) 127)) (= .cse5 (mod (+ .cse3 (* 255 .cse4)) 256))))))))) .cse7) (and .cse8 (or (and .cse0 .cse9 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse12 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse14 (+ (- 256) .cse12))) (let ((.cse11 (mod .cse15 .cse14))) (let ((.cse13 (mod .cse11 256))) (let ((.cse10 (mod .cse14 .cse13))) (and (not (<= (mod (+ .cse10 .cse11) 256) 127)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse12 127)) (= .cse5 (mod (+ .cse10 (* .cse11 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse13 0)))))))))) (and .cse16 (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse21 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse19 (mod .cse21 256))) (let ((.cse22 (+ (- 256) .cse19))) (let ((.cse20 (mod .cse24 .cse22))) (let ((.cse23 (+ (mod (+ .cse20 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse18 (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse17 (mod .cse22 .cse23))) (and (not (= .cse17 0)) (= .cse18 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse19 127)) (= .cse5 (mod (+ .cse20 .cse17 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse18 256)) (not (<= (mod (+ .cse21 .cse17 (* .cse20 255)) 256) 127))))))))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse30 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse25 (mod .cse30 256))) (let ((.cse31 (+ (- 256) .cse25))) (let ((.cse26 (mod .cse24 .cse31))) (let ((.cse32 (+ (mod (+ .cse26 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse29 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse27 (mod .cse31 .cse32))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse25 127)) (= .cse5 (mod (+ .cse26 .cse27 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse28 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse29 0)) (not (<= (mod (+ .cse30 .cse27 (* .cse26 255)) 256) 127))))))))))))))) (and (or (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse37 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse35 (mod .cse37 256))) (let ((.cse38 (+ (- 256) .cse35))) (let ((.cse36 (mod .cse24 .cse38))) (let ((.cse39 (+ (mod (+ .cse36 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse34 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse33 (mod .cse38 .cse39))) (and (not (= .cse33 0)) (= .cse34 0) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse35 127)) (= .cse5 (mod (+ .cse36 .cse33 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse34 256)) (<= (mod (+ .cse37 .cse33 (* .cse36 255)) 256) 127)))))))))) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse44 (* 255 |ULTIMATE.start_gcd_test_#in~b#1|))) (let ((.cse40 (mod .cse44 256))) (let ((.cse45 (+ (- 256) .cse40))) (let ((.cse41 (mod .cse24 .cse45))) (let ((.cse46 (+ (mod (+ .cse41 |ULTIMATE.start_gcd_test_#in~b#1|) 256) (- 256)))) (let ((.cse43 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse42 (mod .cse45 .cse46))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse40 127)) (= .cse5 (mod (+ .cse41 .cse42 |ULTIMATE.start_gcd_test_#in~b#1|) 256)) (= .cse28 (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse43 0)) (<= (mod (+ .cse44 .cse42 (* .cse41 255)) 256) 127))))))))))) .cse8 .cse16) (and .cse0 .cse8 .cse9 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse49 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse51 (+ (- 256) .cse49))) (let ((.cse48 (mod .cse15 .cse51))) (let ((.cse50 (mod .cse48 256))) (let ((.cse47 (mod .cse51 .cse50))) (and (not (= .cse47 0)) (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= (mod (+ .cse47 .cse48) 256) 127) (not (<= .cse49 127)) (= .cse5 (mod (+ .cse47 (* .cse48 255)) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse50 0)))))))))) (and .cse52 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse53 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_38|) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (not (= .cse53 0)) (= (mod (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse53) 256))))) .cse7) (and .cse0 (exists ((|ULTIMATE.start_gcd_test_#in~b#1| Int)) (let ((.cse54 (mod (* 255 |ULTIMATE.start_gcd_test_#in~b#1|) 256))) (let ((.cse58 (+ (- 256) .cse54))) (let ((.cse57 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse58))) (let ((.cse59 (mod .cse57 256))) (let ((.cse55 (mod .cse59 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse56 (mod .cse58 .cse59))) (and (< |ULTIMATE.start_gcd_test_#in~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (not (<= .cse54 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse55 256)) (<= (mod (+ .cse56 .cse57) 256) 127) (not (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (= .cse56 0)) (= .cse5 (mod (+ .cse56 (* 255 .cse57)) 256))))))))) .cse7) (and .cse8 (or (and (or (and .cse52 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse61 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_38|) (mod .cse24 |v_ULTIMATE.start_gcd_test_~a#1_38|)) 256)))) (let ((.cse60 (mod .cse61 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ (* |c_ULTIMATE.start_gcd_test_~a#1| 255) .cse60) 256) .cse28) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (not (= .cse60 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse61) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|)))))) (and .cse52 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse63 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_38|) (mod .cse24 |v_ULTIMATE.start_gcd_test_~a#1_38|)) 256)))) (let ((.cse62 (mod .cse63 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse62 0) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse63) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|))))))) .cse16) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_38| Int)) (let ((.cse64 (mod (mod .cse15 |v_ULTIMATE.start_gcd_test_~a#1_38|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse64 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |v_ULTIMATE.start_gcd_test_~a#1_38| 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_38| .cse64) 256)) (not (= .cse64 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_38|)))) .cse9 .cse52)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true