./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX --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 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:49:51,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:49:51,478 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:49:51,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:49:51,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:49:51,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:49:51,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:49:51,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:49:51,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:49:51,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:49:51,516 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:49:51,517 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:49:51,518 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:49:51,518 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:49:51,519 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:49:51,519 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:49:51,520 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:49:51,520 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:49:51,521 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:49:51,522 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:49:51,522 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:49:51,526 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:49:51,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:49:51,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:49:51,528 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:49:51,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:49:51,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:49:51,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:49:51,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:49:51,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:49:51,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:49:51,532 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:49:51,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:49:51,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:49:51,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:49:51,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:49:51,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:49:51,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:49:51,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:49:51,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:49:51,534 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:49:51,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:49:51,535 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:49:51,535 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:49:51,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:49:51,536 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_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/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_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX 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 -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2023-11-12 00:49:51,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:49:51,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:49:51,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:49:51,854 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:49:51,854 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:49:51,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-11-12 00:49:54,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:49:55,199 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:49:55,200 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2023-11-12 00:49:55,209 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/data/657e211fc/86cb8d0600a24f7a870514c5cc5930d0/FLAGf375c9072 [2023-11-12 00:49:55,224 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/data/657e211fc/86cb8d0600a24f7a870514c5cc5930d0 [2023-11-12 00:49:55,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:49:55,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:49:55,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:49:55,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:49:55,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:49:55,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdc149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55, skipping insertion in model container [2023-11-12 00:49:55,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:49:55,419 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_aa84c9fe-1792-4bdc-b903-86b986130199/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-11-12 00:49:55,445 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_aa84c9fe-1792-4bdc-b903-86b986130199/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-11-12 00:49:55,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:49:55,457 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:49:55,471 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_aa84c9fe-1792-4bdc-b903-86b986130199/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2023-11-12 00:49:55,481 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_aa84c9fe-1792-4bdc-b903-86b986130199/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2023-11-12 00:49:55,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:49:55,498 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:49:55,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55 WrapperNode [2023-11-12 00:49:55,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:49:55,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:49:55,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:49:55,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:49:55,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,543 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-12 00:49:55,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:49:55,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:49:55,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:49:55,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:49:55,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:49:55,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:49:55,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:49:55,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:49:55,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (1/1) ... [2023-11-12 00:49:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:49:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:49:55,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:49:55,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:49:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:49:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-12 00:49:55,660 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-12 00:49:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-12 00:49:55,663 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-12 00:49:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:49:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:49:55,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:49:55,738 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:49:55,740 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:49:55,973 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:49:56,045 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:49:56,045 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 00:49:56,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:56 BoogieIcfgContainer [2023-11-12 00:49:56,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:49:56,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:49:56,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:49:56,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:49:56,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:49:55" (1/3) ... [2023-11-12 00:49:56,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bf1b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:56, skipping insertion in model container [2023-11-12 00:49:56,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:55" (2/3) ... [2023-11-12 00:49:56,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bf1b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:56, skipping insertion in model container [2023-11-12 00:49:56,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:56" (3/3) ... [2023-11-12 00:49:56,058 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2023-11-12 00:49:56,077 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:49:56,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 00:49:56,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:49:56,135 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;@6cf01e7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:49:56,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-12 00:49:56,138 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-12 00:49:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:49:56,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:49:56,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:49:56,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:49:56,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:49:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -291944571, now seen corresponding path program 1 times [2023-11-12 00:49:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:49:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950548283] [2023-11-12 00:49:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:49:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:49:56,573 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-12 00:49:56,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:49:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950548283] [2023-11-12 00:49:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950548283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:49:56,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:49:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:49:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598736205] [2023-11-12 00:49:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:49:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:49:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:49:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:49:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:49:56,621 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12 00:49:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:49:56,772 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-11-12 00:49:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:49:56,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12 00:49:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:49:56,783 INFO L225 Difference]: With dead ends: 39 [2023-11-12 00:49:56,784 INFO L226 Difference]: Without dead ends: 24 [2023-11-12 00:49:56,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:49:56,796 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:49:56,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:49:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-12 00:49:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-12 00:49:56,841 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-12 00:49:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-12 00:49:56,858 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2023-11-12 00:49:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:49:56,858 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-12 00:49:56,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12 00:49:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-12 00:49:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:49:56,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:49:56,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:49:56,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:49:56,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:49:56,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:49:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash -533010262, now seen corresponding path program 1 times [2023-11-12 00:49:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:49:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036789139] [2023-11-12 00:49:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:49:56,885 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-12 00:49:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210182645] [2023-11-12 00:49:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:49:56,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:49:56,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:49:56,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:49:56,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:49:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:49:56,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:49:56,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:49:57,534 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-12 00:49:57,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:49:57,633 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-12 00:49:57,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:49:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036789139] [2023-11-12 00:49:57,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-12 00:49:57,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210182645] [2023-11-12 00:49:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210182645] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:49:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156538357] [2023-11-12 00:49:57,665 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-11-12 00:49:57,666 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:49:57,670 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:49:57,676 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:49:57,677 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:50:00,628 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:50:00,945 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '164#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= (+ |ULTIMATE.start_main1_~y~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= 1 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |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))' at error location [2023-11-12 00:50:00,945 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:50:00,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:50:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-12 00:50:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32459244] [2023-11-12 00:50:00,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:50:00,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:50:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:50:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-12 00:50:00,951 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-12 00:50:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:01,122 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-11-12 00:50:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:50:01,123 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-12 00:50:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:01,124 INFO L225 Difference]: With dead ends: 31 [2023-11-12 00:50:01,124 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:50:01,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-12 00:50:01,127 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:01,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 150 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:50:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:50:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-12 00:50:01,142 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-12 00:50:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-12 00:50:01,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2023-11-12 00:50:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:01,145 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-12 00:50:01,145 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-12 00:50:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-12 00:50:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:50:01,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:01,147 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:01,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:50:01,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-12 00:50:01,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:50:01,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 847992842, now seen corresponding path program 2 times [2023-11-12 00:50:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370479877] [2023-11-12 00:50:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:01,371 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-12 00:50:01,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459476132] [2023-11-12 00:50:01,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:50:01,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:50:01,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:50:01,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:50:01,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa84c9fe-1792-4bdc-b903-86b986130199/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:50:01,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:50:01,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:50:01,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 00:50:01,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:41,003 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0) (let ((.cse0 (mod .cse2 256))) (or (and (not (= .cse0 0)) (<= .cse0 127) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse1 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|))) (not (= .cse1 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= (mod (+ .cse1 .cse2) 256) 127)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (<= 128 (mod (* .cse3 255) 256)) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse3 256)) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ .cse3 .cse2) 256) 127)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse5 |c_ULTIMATE.start_main1_~y~0#1|) 256))))) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= 128 (mod (+ .cse5 |c_ULTIMATE.start_main1_~y~0#1| .cse6) 256)) (= (mod .cse6 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ .cse5 .cse2) 256))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= 128 (mod (+ .cse7 .cse2) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse7 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (let ((.cse8 (mod .cse9 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse8) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (not (= .cse8 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ .cse9 .cse2) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse10 256)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 128 (mod (+ .cse10 .cse2) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse11 256)) 0) (<= 128 (mod (+ .cse11 .cse2) 256)) (<= 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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse0))) (and (not (= .cse12 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse12 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 0) (<= (mod (+ .cse12 .cse2) 256) 127)))) .cse4))) (and (let ((.cse18 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse15 (+ .cse0 (- 256)))) (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse13 (mod .cse14 256))) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (not (= .cse13 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse13) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256) 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse19 (mod .cse17 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19))) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (= (mod (+ .cse16 (* 255 .cse17)) 256) .cse18) (not (= .cse16 0))))) (not (= .cse19 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256) 127))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse20 (mod .cse21 256))) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (not (= .cse20 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse20) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (exists ((v_y_1 Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse23 (* 256 v_y_1)) (.cse22 (mod (+ .cse2 .cse24) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse22 (+ .cse23 511)) (<= (+ .cse23 384) .cse22) (not (= .cse24 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ .cse22 (- 256))) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((v_y_1 Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse26 (* 256 v_y_1)) (.cse25 (mod (+ .cse2 .cse27) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= .cse25 (+ .cse26 511)) (<= (+ .cse26 384) .cse25) (not (= .cse27 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse27) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ .cse25 (- 256))) 0))))) (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse30 (mod .cse29 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse30))) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (= (mod (+ .cse28 (* 255 .cse29)) 256) .cse18) (not (= .cse28 0))))) (not (= .cse30 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse29) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse31 (mod .cse32 256))) (and (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse31) 256)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse2 .cse34) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse33 0)) (not (= .cse34 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256)) (= (mod (+ .cse2 .cse33 .cse34) 256) .cse18))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse35 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse35) 256)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse2 .cse35) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse0 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse2 .cse37) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse36 0)) (not (= .cse37 0)) (= (mod (+ .cse2 .cse36 .cse37) 256) .cse18) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse37) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (let ((.cse38 (mod .cse39 256))) (and (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse38) 256)))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse39) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse15))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse40 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse2 .cse40) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse40) 256) 127)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) (<= 128 .cse0))))) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((v_z_4 Int)) (and (exists ((v_y_4 Int)) (let ((.cse41 (+ (* 256 v_y_4) (* 255 v_z_4)))) (and (<= 0 .cse41) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse41) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse41 (mod .cse42 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse42) 256) 127))))))) (<= v_z_4 255) (<= 128 v_z_4))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((v_z_4 Int)) (and (exists ((v_y_4 Int)) (let ((.cse43 (+ (* 256 v_y_4) (* 255 v_z_4)))) (and (<= 0 .cse43) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse43) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse43 (mod .cse44 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse44) 256)))))))) (<= v_z_4 255) (<= 128 v_z_4)))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse45 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse2 .cse45) 256))) 256)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256) 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse46 256)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse48 256)))) (let ((.cse47 (mod .cse49 256))) (and (<= .cse47 127) (= .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ (* 255 .cse48) .cse49) 256)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse48) 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (and (or (exists ((v_y_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (* 256 v_y_6)) (.cse51 (mod (+ .cse2 .cse52) 256))) (and (<= (+ 384 .cse50) .cse51) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= .cse51 (+ 511 .cse50)) (not (= .cse52 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) .cse51)) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256) 127))))) (exists ((v_y_6 Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse53 (* 256 v_y_6)) (.cse54 (mod (+ .cse2 .cse55) 256))) (and (<= (+ 384 .cse53) .cse54) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= .cse54 (+ 511 .cse53)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse55) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) .cse54)) 0)))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse2 .cse56) 256))) 256))))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2023-11-12 00:50:51,206 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse1 256)))) (let ((.cse0 (mod .cse2 256))) (and (<= .cse0 127) (= .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ (* 255 .cse1) .cse2) 256)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse3 .cse4) 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse3 .cse5) 256))) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse5 0)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse5) 256) 127)))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse6 256)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse6) 256))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_33|)))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)) (and (let ((.cse9 (mod .cse3 256))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse9))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (<= 128 (mod (+ .cse7 .cse3) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse7 |c_ULTIMATE.start_main1_~y~0#1|) 256))))) (and (= (mod .cse8 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_33|) (<= 128 (mod (+ .cse7 |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse9))) (let ((.cse10 (mod .cse11 256))) (and (not (= .cse10 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse10) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ .cse11 .cse3) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse9))) (and (not (= .cse12 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (- 256) (mod (+ .cse12 |c_ULTIMATE.start_main1_~y~0#1|) 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= (mod (+ .cse12 .cse3) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse9))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (mod .cse13 256)) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 128 (mod (+ .cse13 .cse3) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (not (= .cse9 0)) (<= .cse9 127)) (and (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse17 (+ .cse9 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse9 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse15) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse14 0)) (= (mod (+ .cse3 .cse14 .cse15) 256) .cse16) (not (= .cse15 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse15) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse18 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse18) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256) 127)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (let ((.cse19 (mod .cse21 256))) (and (not (= .cse19 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse19))) (and (<= .cse9 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (not (= .cse20 0)) (= .cse16 (mod (+ .cse20 (* 255 .cse21)) 256))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (let ((.cse22 (mod .cse23 256))) (and (not (= .cse22 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse22) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse24 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse24) 256) (- 256))) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (<= .cse9 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| (+ (mod (+ .cse3 .cse26) 256) (- 256))))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_32| 1) 0) (not (= .cse25 0)) (= (mod (+ .cse3 .cse25 .cse26) 256) .cse16) (not (= .cse26 0)) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (let ((.cse27 (mod .cse29 256))) (and (not (= .cse27 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse27))) (and (<= .cse9 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_33|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_33| 1) 0) (not (= .cse28 0)) (= .cse16 (mod (+ .cse28 (* 255 .cse29)) 256))))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse29) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse17))) (let ((.cse30 (mod .cse31 256))) (and (not (= .cse30 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse30) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_32|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse31) 256) 127))))))) (<= 128 .cse9)))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0)))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse37 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse38 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse39 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= .cse45 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse45)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse46 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_34|) (<= 128 .cse46) (= .cse46 .cse37)))))) (.cse40 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0))) (or (and (let ((.cse34 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse33 (mod (+ .cse34 .cse32) 256))) (and (not (= .cse32 0)) (<= .cse33 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse33))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse36 (mod (+ .cse34 .cse35) 256))) (and (not (= .cse35 0)) (<= 128 .cse36) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse36 .cse37))))))) .cse38) (and .cse38 .cse39) (and .cse40 .cse39) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse41) 256))) (and (not (= .cse41 0)) (<= 128 .cse42) (= .cse42 .cse37) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse43) 256))) (and (not (= .cse43 0)) (<= .cse44 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_34| 1) 0) (= .cse44 |c_ULTIMATE.start_gcd_test_~b#1|)))))) .cse40) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_34| Int)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_34| |c_ULTIMATE.start_gcd_test_~a#1|) 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)))))) is different from false