./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5a5fcfdef398824c80e5dd00ccb13245b1aba31a53b04be2e0e92d8a739e53d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 18:59:47,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 18:59:48,042 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-21 18:59:48,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 18:59:48,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 18:59:48,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 18:59:48,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 18:59:48,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 18:59:48,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 18:59:48,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 18:59:48,083 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 18:59:48,084 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 18:59:48,084 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 18:59:48,085 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-21 18:59:48,085 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 18:59:48,086 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 18:59:48,086 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-21 18:59:48,086 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-21 18:59:48,087 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 18:59:48,087 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-21 18:59:48,088 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-21 18:59:48,089 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-21 18:59:48,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 18:59:48,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 18:59:48,090 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 18:59:48,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 18:59:48,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 18:59:48,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 18:59:48,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 18:59:48,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 18:59:48,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 18:59:48,093 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 18:59:48,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 18:59:48,094 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 18:59:48,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 18:59:48,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 18:59:48,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 18:59:48,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 18:59:48,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 18:59:48,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 18:59:48,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 18:59:48,096 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-21 18:59:48,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 18:59:48,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 18:59:48,096 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 18:59:48,097 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 18:59:48,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 18:59:48,097 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/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_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> f5a5fcfdef398824c80e5dd00ccb13245b1aba31a53b04be2e0e92d8a739e53d [2023-11-21 18:59:48,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 18:59:48,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 18:59:48,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 18:59:48,433 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 18:59:48,433 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 18:59:48,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/combinations/gcd_3+newton_3_7.i [2023-11-21 18:59:51,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 18:59:51,738 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 18:59:51,739 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/sv-benchmarks/c/combinations/gcd_3+newton_3_7.i [2023-11-21 18:59:51,748 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/data/dc3b430ca/e95d044e05fa466880dfca4e3f8b7ec1/FLAGa2ef472be [2023-11-21 18:59:51,764 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/data/dc3b430ca/e95d044e05fa466880dfca4e3f8b7ec1 [2023-11-21 18:59:51,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 18:59:51,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 18:59:51,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 18:59:51,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 18:59:51,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 18:59:51,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 06:59:51" (1/1) ... [2023-11-21 18:59:51,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6480583e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:51, skipping insertion in model container [2023-11-21 18:59:51,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 06:59:51" (1/1) ... [2023-11-21 18:59:51,805 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 18:59:51,980 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/sv-benchmarks/c/combinations/gcd_3+newton_3_7.i[1226,1239] [2023-11-21 18:59:52,008 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/sv-benchmarks/c/combinations/gcd_3+newton_3_7.i[2862,2875] [2023-11-21 18:59:52,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 18:59:52,024 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 18:59:52,047 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/sv-benchmarks/c/combinations/gcd_3+newton_3_7.i[1226,1239] [2023-11-21 18:59:52,059 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/sv-benchmarks/c/combinations/gcd_3+newton_3_7.i[2862,2875] [2023-11-21 18:59:52,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 18:59:52,076 INFO L206 MainTranslator]: Completed translation [2023-11-21 18:59:52,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52 WrapperNode [2023-11-21 18:59:52,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 18:59:52,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 18:59:52,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 18:59:52,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 18:59:52,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,117 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-21 18:59:52,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 18:59:52,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 18:59:52,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 18:59:52,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 18:59:52,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 18:59:52,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 18:59:52,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 18:59:52,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 18:59:52,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (1/1) ... [2023-11-21 18:59:52,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 18:59:52,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 18:59:52,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 18:59:52,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 18:59:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 18:59:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-21 18:59:52,227 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-21 18:59:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-21 18:59:52,227 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-21 18:59:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 18:59:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 18:59:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 18:59:52,308 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 18:59:52,310 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 18:59:52,491 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 18:59:52,574 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 18:59:52,574 INFO L308 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-21 18:59:52,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 06:59:52 BoogieIcfgContainer [2023-11-21 18:59:52,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 18:59:52,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 18:59:52,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 18:59:52,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 18:59:52,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 06:59:51" (1/3) ... [2023-11-21 18:59:52,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c697ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 06:59:52, skipping insertion in model container [2023-11-21 18:59:52,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 06:59:52" (2/3) ... [2023-11-21 18:59:52,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c697ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 06:59:52, skipping insertion in model container [2023-11-21 18:59:52,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 06:59:52" (3/3) ... [2023-11-21 18:59:52,587 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_7.i [2023-11-21 18:59:52,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 18:59:52,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 18:59:52,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 18:59:52,671 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@182756c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 18:59:52,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 18:59:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 18:59:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 18:59:52,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:59:52,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 18:59:52,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:59:52,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:59:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -377832024, now seen corresponding path program 1 times [2023-11-21 18:59:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:59:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526044172] [2023-11-21 18:59:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:59:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:59:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:59:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:59:53,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:59:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526044172] [2023-11-21 18:59:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526044172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 18:59:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 18:59:53,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 18:59:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359889012] [2023-11-21 18:59:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 18:59:53,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 18:59:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 18:59:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 18:59:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 18:59:53,316 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 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) [2023-11-21 18:59:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 18:59:53,422 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-11-21 18:59:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 18:59:53,425 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 [2023-11-21 18:59:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 18:59:53,432 INFO L225 Difference]: With dead ends: 40 [2023-11-21 18:59:53,432 INFO L226 Difference]: Without dead ends: 24 [2023-11-21 18:59:53,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 18:59:53,439 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 18:59:53,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 18:59:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-21 18:59:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-21 18:59:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 18:59:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-21 18:59:53,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2023-11-21 18:59:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 18:59:53,481 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-21 18:59:53,482 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) [2023-11-21 18:59:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-21 18:59:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 18:59:53,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 18:59:53,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 18:59:53,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 18:59:53,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:59:53,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:59:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1099445991, now seen corresponding path program 1 times [2023-11-21 18:59:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 18:59:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828974223] [2023-11-21 18:59:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:59:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:59:53,502 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 18:59:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287412130] [2023-11-21 18:59:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:59:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 18:59:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 18:59:53,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 18:59:53,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 18:59:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 18:59:53,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-21 18:59:53,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 18:59:55,333 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (<= 128 .cse8)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse8 (- 256))) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (<= .cse8 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse0) (and .cse1 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse2 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (not (= .cse2 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (= (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) .cse3) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse5)) .cse6) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse0) (and .cse1 (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (not (= .cse9 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (+ .cse9 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_22|)) 256) .cse3) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))))))))) is different from true [2023-11-21 18:59:55,812 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse3 (<= .cse4 127)) (.cse2 (+ .cse4 (- 256))) (.cse1 (<= 128 .cse4)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))))) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse1)) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse5)))) is different from true [2023-11-21 18:59:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 18:59:55,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 18:59:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 18:59:57,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 18:59:57,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828974223] [2023-11-21 18:59:57,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 18:59:57,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287412130] [2023-11-21 18:59:57,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287412130] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 18:59:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916551975] [2023-11-21 18:59:57,430 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-11-21 18:59:57,430 INFO L166 IcfgInterpreter]: Building call graph [2023-11-21 18:59:57,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-21 18:59:57,441 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-21 18:59:57,442 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-21 18:59:58,530 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-21 18:59:58,844 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '168#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 1 |ULTIMATE.start_main1_~x~0#1|) (<= (+ |ULTIMATE.start_main1_~x~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 (+ |ULTIMATE.start_main1_~y~0#1| 128)))' at error location [2023-11-21 18:59:58,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-21 18:59:58,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 18:59:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-21 18:59:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123828049] [2023-11-21 18:59:58,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 18:59:58,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 18:59:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 18:59:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 18:59:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=129, Unknown=2, NotChecked=46, Total=210 [2023-11-21 18:59:58,848 INFO L87 Difference]: Start difference. First operand 24 states and 28 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) [2023-11-21 19:00:00,956 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (not .cse0) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse1) .cse2) (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse1) .cse2 (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (and (or (not (= (mod .cse3 256) 0)) (and (<= .cse4 0) (not (= .cse3 0)))) (or (not (= (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 0)) (< 0 .cse4))))) (let ((.cse12 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (<= .cse1 0)) (.cse10 (<= 128 .cse12)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse9 (+ .cse12 (- 256))) (.cse11 (<= .cse12 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5) (and .cse6 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse7 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (not (= .cse7 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (= (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) .cse8) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse0)) .cse10) (and .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse12 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse5) (and .cse6 (or (and .cse10 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse13 (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (not (= .cse13 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_22|)) 256) .cse8) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse9 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse0))) (and .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse12 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))))))))))) is different from true [2023-11-21 19:00:00,989 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (< |c_ULTIMATE.start_main1_~g~0#1| .cse0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (let ((.cse5 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse4 (<= .cse5 127)) (.cse3 (+ .cse5 (- 256))) (.cse2 (<= 128 .cse5)) (.cse1 (<= .cse0 0)) (.cse6 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse1 (or (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))))) (and (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse2)) .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse6) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse6)))))) is different from true [2023-11-21 19:00:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:00:01,604 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2023-11-21 19:00:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 19:00:01,605 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 [2023-11-21 19:00:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:00:01,606 INFO L225 Difference]: With dead ends: 32 [2023-11-21 19:00:01,606 INFO L226 Difference]: Without dead ends: 26 [2023-11-21 19:00:01,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=42, Invalid=152, Unknown=4, NotChecked=108, Total=306 [2023-11-21 19:00:01,609 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 19:00:01,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 83 Unchecked, 0.6s Time] [2023-11-21 19:00:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-21 19:00:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-21 19:00:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-21 19:00:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-21 19:00:01,630 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2023-11-21 19:00:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:00:01,630 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-21 19:00:01,630 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) [2023-11-21 19:00:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-21 19:00:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 19:00:01,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:00:01,633 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-11-21 19:00:01,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-21 19:00:01,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:00:01,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:00:01,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:00:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1975388935, now seen corresponding path program 2 times [2023-11-21 19:00:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:00:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160838524] [2023-11-21 19:00:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:00:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:00:01,865 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 19:00:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560883451] [2023-11-21 19:00:01,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:00:01,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:00:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 19:00:01,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:00:01,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2ba56cd-9085-4e98-bd1b-363f2a5ee594/bin/utaipan-verify-QoSU8krkJ5/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 19:00:02,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 19:00:02,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:00:02,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-21 19:00:02,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:00:33,749 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse16 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse9 (+ .cse16 (- 256))) (.cse0 (<= 128 .cse16)) (.cse10 (<= .cse16 127)) (.cse31 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0) (let ((.cse6 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse4) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (<= 128 .cse2) (= .cse2 .cse3) (<= (mod .cse4 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse7 (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse8 (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) .cse8)))) (and (not (= .cse5 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse6 (mod (+ .cse7 .cse5 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (<= .cse8 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|))))))) (not (= .cse4 0))))))) (and .cse1 (or (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse11 (mod .cse12 256))) (and (= .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse12) 256)) (<= .cse11 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse14 (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse15 (mod .cse14 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (and (= .cse6 (mod (+ .cse13 (* 255 .cse14)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= .cse15 0)) (not (= .cse13 0)))))))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse17 (mod .cse18 256))) (and (= .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse18) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse20 (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) (mod (+ .cse20 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))))) (and (not (= .cse19 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse6 (mod (+ .cse20 .cse19 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))))) (<= .cse17 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|)))))))) (and (<= 128 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse22 (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse23 (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) .cse23)))) (and (not (= .cse21 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse6 (mod (+ .cse22 .cse21 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)) (<= .cse23 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse25 (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse26 (mod .cse25 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse26))) (and (= .cse6 (mod (+ .cse24 (* 255 .cse25)) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= .cse26 0)) (not (= .cse24 0))))))))) .cse10)) .cse1) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse29))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse6 (mod (+ .cse27 (* 255 .cse28)) 256)) (not (= .cse29 0)) (not (= .cse27 0)) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_33|)))))))) .cse30)) .cse31) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse32 (mod .cse33 256))) (and (= .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse33) 256)) (<= .cse32 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse36 (mod .cse35 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse36))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= .cse6 (mod (+ .cse34 (* 255 .cse35)) 256)) (not (= .cse36 0)) (not (= .cse34 0)) (<= .cse36 |v_ULTIMATE.start_gcd_test_~a#1_33|)))))))))) .cse30)))) (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (or (and .cse1 (let ((.cse39 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse37 (mod (+ (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) .cse37)) 256)) (<= .cse37 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) .cse31) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse38 (mod (+ (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) .cse38)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (= (mod (+ .cse39 .cse40) 256) .cse3) (<= .cse38 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (not (= .cse40 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) (mod (+ (mod .cse9 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256))) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) .cse0) (and .cse10 (or (and .cse31 (<= 128 (mod .cse39 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse41 (mod (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (<= .cse41 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse41) 256)) (not (= .cse41 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod .cse43 256))) (and (= .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 128 (mod (+ .cse39 .cse43) 256)) (<= .cse42 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse44 (mod (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (<= .cse44 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse44) 256)) (not (= .cse44 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse45 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (not (= .cse45 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse45) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse45 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse46 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (not (= .cse46 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse46) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= .cse46 |v_ULTIMATE.start_gcd_test_~a#1_33|)))) .cse31)) .cse30))))))) is different from false [2023-11-21 19:00:39,506 WARN L854 $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 ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse10 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (<= .cse8 127)) (.cse4 (+ .cse8 (- 256))) (.cse5 (<= 128 .cse8))) (or (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (not (= .cse1 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 256)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse1) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) .cse2) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse3 (mod (+ (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256))) (and (<= .cse3 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) .cse3)) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) (mod (+ (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_32|) (* 255 |v_ULTIMATE.start_gcd_test_~a#1_32|)) 256))) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) .cse5) (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse7 (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= .cse7 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse7) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse9 (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (and (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= .cse9 0)) (= |c_ULTIMATE.start_main1_~g~0#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse9) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 256))))))) .cse10)) (<= 0 |c_ULTIMATE.start_main1_~g~0#1|)) (and (let ((.cse14 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse11 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse11))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse11 0)) (not (= .cse12 0)) (= (mod (+ .cse12 (* 255 .cse13)) 256) .cse14) (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_33|)))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 0))) .cse2) (and (or (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse16 (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse17 (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) .cse17)))) (and (not (= .cse15 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod (+ .cse16 .cse15 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256) .cse14) (<= .cse17 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|))))))) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 0)))) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse20 (mod .cse8 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse18 (mod .cse20 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse18))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= .cse18 0)) (not (= .cse19 0)) (= (mod (+ .cse19 (* 255 .cse20)) 256) .cse14)))))))))) .cse10)) (<= 128 (mod |c_ULTIMATE.start_main1_~g~0#1| 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse21 (mod .cse23 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse21))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse21 0)) (not (= .cse22 0)) (= (mod (+ .cse22 (* 255 .cse23)) 256) .cse14) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_33|)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= 0 (mod .cse24 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~g~0#1| .cse24) 256))))) .cse2) (and .cse10 (or (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= 0 (mod .cse25 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse28 (mod .cse8 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse26 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse26))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_33|) (not (= .cse26 0)) (not (= .cse27 0)) (= (mod (+ .cse27 (* 255 .cse28)) 256) .cse14)))))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~g~0#1| .cse25) 256)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse30 (mod .cse4 |v_ULTIMATE.start_gcd_test_~a#1_32|))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| (+ (- 256) (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))))) (and (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_32|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (= (mod (+ .cse30 .cse29 |v_ULTIMATE.start_gcd_test_~a#1_32|) 256) .cse14))))) .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~g~0#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= 0 (mod .cse31 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~g~0#1| .cse31) 256)))))))))) (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0)))))) is different from false [2023-11-21 19:00:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 19:00:41,553 INFO L327 TraceCheckSpWp]: Computing backward predicates...