./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje --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 cdcc8697c8b9bd3a25c95b335058fb611b45ef6a0bd08057dccc283c9b370e3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:37:21,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:37:21,284 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:37:21,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:37:21,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:37:21,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:37:21,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:37:21,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:37:21,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:37:21,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:37:21,339 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:37:21,340 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:37:21,340 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:37:21,341 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:37:21,344 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:37:21,344 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:37:21,345 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:37:21,345 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:37:21,346 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:37:21,346 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:37:21,347 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:37:21,347 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:37:21,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:37:21,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:37:21,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:37:21,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:37:21,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:37:21,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:37:21,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:37:21,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:37:21,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:37:21,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:37:21,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:37:21,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:37:21,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:37:21,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:37:21,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:37:21,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:37:21,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:37:21,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:37:21,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:37:21,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:37:21,363 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:37:21,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:37:21,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:37:21,364 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:37:21,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:37:21,364 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/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_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje 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 -> cdcc8697c8b9bd3a25c95b335058fb611b45ef6a0bd08057dccc283c9b370e3d [2024-11-09 06:37:21,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:37:21,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:37:21,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:37:21,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:37:21,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:37:21,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i Unable to find full path for "g++" [2024-11-09 06:37:23,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:37:24,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:37:24,228 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i [2024-11-09 06:37:24,238 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data/4e3b9e3f6/af7668c772124bd280f5e6e404f068d4/FLAG8daff4f7c [2024-11-09 06:37:24,527 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data/4e3b9e3f6/af7668c772124bd280f5e6e404f068d4 [2024-11-09 06:37:24,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:37:24,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:37:24,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:37:24,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:37:24,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:37:24,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:24,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcff107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24, skipping insertion in model container [2024-11-09 06:37:24,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:24,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:37:24,833 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[1226,1239] [2024-11-09 06:37:24,875 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[2862,2875] [2024-11-09 06:37:24,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:37:24,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:37:24,924 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[1226,1239] [2024-11-09 06:37:24,957 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[2862,2875] [2024-11-09 06:37:24,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:37:24,990 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:37:24,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24 WrapperNode [2024-11-09 06:37:24,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:37:24,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:37:24,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:37:24,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:37:25,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,056 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2024-11-09 06:37:25,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:37:25,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:37:25,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:37:25,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:37:25,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:37:25,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:37:25,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:37:25,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:37:25,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (1/1) ... [2024-11-09 06:37:25,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:37:25,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:37:25,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:37:25,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:37:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:37:25,217 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 06:37:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 06:37:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 06:37:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 06:37:25,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:37:25,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:37:25,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:37:25,322 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:37:25,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:37:25,625 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 06:37:25,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:37:25,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:37:25,688 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:37:25,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:37:25 BoogieIcfgContainer [2024-11-09 06:37:25,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:37:25,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:37:25,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:37:25,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:37:25,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:24" (1/3) ... [2024-11-09 06:37:25,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35eef841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:25, skipping insertion in model container [2024-11-09 06:37:25,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:24" (2/3) ... [2024-11-09 06:37:25,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35eef841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:25, skipping insertion in model container [2024-11-09 06:37:25,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:37:25" (3/3) ... [2024-11-09 06:37:25,699 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_4.i [2024-11-09 06:37:25,719 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:37:25,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:37:25,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:37:25,791 INFO L333 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, 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;@42ac73ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:37:25,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:37:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 21 states have internal predecessors, (27), 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) [2024-11-09 06:37:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:37:25,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:25,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:37:25,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:37:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1043945358, now seen corresponding path program 1 times [2024-11-09 06:37:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490731853] [2024-11-09 06:37:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:37:26,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:37:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490731853] [2024-11-09 06:37:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490731853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:37:26,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:37:26,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:37:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026653213] [2024-11-09 06:37:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:37:26,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:37:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:37:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:37:26,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:37:26,530 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 21 states have internal predecessors, (27), 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.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:37:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:37:26,649 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-09 06:37:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:37:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:37:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:37:26,661 INFO L225 Difference]: With dead ends: 42 [2024-11-09 06:37:26,661 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 06:37:26,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:37:26,670 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:37:26,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:37:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 06:37:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 06:37:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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) [2024-11-09 06:37:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 06:37:26,711 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2024-11-09 06:37:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:37:26,712 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 06:37:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:37:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 06:37:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:37:26,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:26,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:37:26,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:37:26,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:37:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1651025175, now seen corresponding path program 1 times [2024-11-09 06:37:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261991564] [2024-11-09 06:37:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:37:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172715490] [2024-11-09 06:37:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:26,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:37:26,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:37:26,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:37:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:26,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:37:26,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:37:28,883 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse8 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (<= .cse7 127)) (.cse5 (<= 128 .cse7)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse2 (+ .cse7 (- 256))) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (or (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse3 (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse3 0)) (= (mod (+ .cse3 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse4))))) .cse5) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse8) (and .cse8 (or (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse5 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse9 (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse9 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse9 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse1)))))))) is different from true [2024-11-09 06:37:29,269 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse4 (<= 128 .cse2)) (.cse3 (+ .cse2 (- 256))) (.cse1 (<= .cse2 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse4)) .cse5) (and .cse5 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))))))) is different from true [2024-11-09 06:37:29,660 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse3 (<= .cse2 127)) (.cse5 (+ .cse2 (- 256))) (.cse4 (<= 128 .cse2)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse3) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse4)) .cse1)))) is different from true [2024-11-09 06:37:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 06:37:29,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:37:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:37:31,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:37:31,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261991564] [2024-11-09 06:37:31,132 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:37:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172715490] [2024-11-09 06:37:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172715490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:37:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1485293795] [2024-11-09 06:37:31,162 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 06:37:31,162 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:37:31,166 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:37:31,174 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:37:31,176 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:37:32,396 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:37:32,671 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '193#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 06:37:32,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:37:32,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:37:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-09 06:37:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356192652] [2024-11-09 06:37:32,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:37:32,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:37:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:37:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:37:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=170, Unknown=3, NotChecked=84, Total=306 [2024-11-09 06:37:32,676 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2024-11-09 06:37:35,226 WARN L873 $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 ((.cse11 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse12 (<= .cse1 0)) (.cse10 (<= .cse11 127)) (.cse9 (<= 128 .cse11)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (+ .cse11 (- 256)))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse5) (and (or (and (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse7 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= .cse7 0)) (= (mod (+ .cse7 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_24|)) 256) .cse8))))) .cse9) (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) .cse12) (and .cse12 (or (and .cse10 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and .cse9 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (let ((.cse13 (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_24|) 256) .cse8) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)) (not (= .cse13 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse0)))))))))) is different from true [2024-11-09 06:37:42,988 WARN L873 $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 ((.cse3 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse1 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse4 (<= .cse3 127)) (.cse6 (+ .cse3 (- 256))) (.cse5 (<= 128 .cse3)) (.cse2 (<= .cse0 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse1) (and .cse2 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse4) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse1) (and (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse6 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse5)) .cse2)))))) is different from true [2024-11-09 06:37:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:37:43,313 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-09 06:37:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:37:43,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 06:37:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:37:43,317 INFO L225 Difference]: With dead ends: 37 [2024-11-09 06:37:43,317 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 06:37:43,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=57, Invalid=195, Unknown=8, NotChecked=160, Total=420 [2024-11-09 06:37:43,319 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:37:43,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 144 Unchecked, 0.6s Time] [2024-11-09 06:37:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 06:37:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 06:37:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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) [2024-11-09 06:37:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 06:37:43,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 9 [2024-11-09 06:37:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:37:43,332 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 06:37:43,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2024-11-09 06:37:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 06:37:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:37:43,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:43,334 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:37:43,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:37:43,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 06:37:43,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:37:43,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:43,539 INFO L85 PathProgramCache]: Analyzing trace with hash 85594065, now seen corresponding path program 1 times [2024-11-09 06:37:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:43,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232902750] [2024-11-09 06:37:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:37:43,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:37:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232902750] [2024-11-09 06:37:43,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232902750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:37:43,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:37:43,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:37:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525449071] [2024-11-09 06:37:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:37:43,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:37:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:37:43,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:37:43,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:37:43,638 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:37:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:37:43,774 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-09 06:37:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:37:43,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:37:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:37:43,776 INFO L225 Difference]: With dead ends: 35 [2024-11-09 06:37:43,776 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 06:37:43,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:37:43,778 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:37:43,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:37:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 06:37:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 06:37:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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) [2024-11-09 06:37:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-09 06:37:43,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 10 [2024-11-09 06:37:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:37:43,789 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-09 06:37:43,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:37:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 06:37:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:37:43,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:43,791 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:37:43,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:37:43,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:37:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1294520671, now seen corresponding path program 2 times [2024-11-09 06:37:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28634577] [2024-11-09 06:37:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 06:37:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536600088] [2024-11-09 06:37:43,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:37:43,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:43,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:37:43,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:37:43,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:37:44,025 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 06:37:44,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:37:44,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:37:44,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:37:50,565 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse8 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse2 (- 256))) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (<= 128 .cse2)) (.cse1 (<= .cse2 127)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse3 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse5) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse6 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse6 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse7) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse6 0)))))))) .cse8) (and .cse8 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse9 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse7 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse9) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse5)) .cse3) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse0)))) is different from true [2024-11-09 06:37:51,703 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (let ((.cse7 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse5 (+ .cse7 (- 256))) (.cse2 (<= 128 .cse7)) (.cse6 (<= .cse7 127)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse0) (and .cse1 (or (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse3 (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse4) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse3 0)))))) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse0) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse8 (mod .cse5 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse8 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse8) 256))))) .cse2) (and .cse6 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse1))))) is different from true [2024-11-09 06:38:01,768 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) is different from true [2024-11-09 06:38:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-09 06:38:25,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:39:11,435 WARN L286 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 86 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:39:17,589 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse18 (mod (+ .cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse19 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse4 (= .cse18 0)) (.cse5 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse18) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse1 (< 127 .cse18)) (.cse8 (or .cse4 .cse5 .cse6)) (.cse10 (< .cse18 128)) (.cse7 (< .cse19 128)) (.cse9 (< 127 .cse19)) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse18)) .cse13)))) (.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (mod .cse14 256))) (and (or (< 127 .cse0) (let ((.cse3 (= .cse14 0)) (.cse2 (or .cse12 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse0) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse0 0)))) (and (or .cse1 (and (or (and .cse2 (or .cse3 .cse4 .cse5 .cse6)) .cse7) (or (and .cse2 .cse8) .cse9))) (or .cse10 (and (or .cse3 .cse11 .cse5) .cse2))))) (or (< .cse0 128) (let ((.cse16 (or .cse12 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse0)) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse1 (let ((.cse15 (and .cse8 .cse16))) (and (or .cse9 .cse15) (or .cse7 .cse15)))) (or .cse10 (let ((.cse17 (and (or .cse11 .cse5) .cse16))) (and (or .cse7 .cse17) (or .cse9 .cse17)))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) is different from false [2024-11-09 06:39:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 06:39:17,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:39:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28634577] [2024-11-09 06:39:17,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 06:39:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536600088] [2024-11-09 06:39:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536600088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:39:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1210968722] [2024-11-09 06:39:17,844 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 06:39:17,844 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:39:17,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:39:17,845 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:39:17,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:39:18,308 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:39:21,961 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '485#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 06:39:21,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:39:21,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:39:21,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-09 06:39:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202469749] [2024-11-09 06:39:21,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:39:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:39:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:39:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:39:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=278, Unknown=17, NotChecked=148, Total=506 [2024-11-09 06:39:21,965 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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) [2024-11-09 06:39:22,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse13 (mod (+ .cse36 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse1 (mod .cse36 256))) (let ((.cse15 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (< 127 .cse1)) (.cse4 (= .cse36 0)) (.cse12 (< .cse1 128)) (.cse3 (< 127 .cse13)) (.cse10 (< 127 .cse14)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse8 (< .cse14 .cse2)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (< .cse13 .cse2))) (and (or (and (or .cse0 (< .cse1 .cse2)) (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse8 .cse9 .cse10 .cse7)) .cse11) (or .cse12 (and (or .cse8 .cse9 .cse10 .cse7) (or .cse3 .cse5 .cse6 .cse7))))) .cse15 .cse16) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse2) .cse16) (let ((.cse19 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse24 (<= .cse2 0)) (.cse23 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse19 (- 256))) (.cse20 (<= 128 .cse19)) (.cse18 (<= .cse19 127)) (.cse17 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse17) (and (or (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse20 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse22 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse23) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse22 0)))))))) .cse24) (and .cse24 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse25 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse25 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse23 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse25) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse15)) .cse20) (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse17)))) (or (let ((.cse27 (= .cse13 0)) (.cse28 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse13) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse30 (or .cse27 .cse7 .cse28)) (.cse31 (< .cse13 128)) (.cse29 (< .cse14 128)) (.cse32 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse13)) .cse2))))) (and (or .cse11 (let ((.cse26 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse1) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse1 0)))) (and (or .cse3 (and (or (and .cse26 (or .cse4 .cse27 .cse7 .cse28)) .cse29) (or (and .cse26 .cse30) .cse10))) (or .cse31 (and (or .cse4 .cse32 .cse7) .cse26))))) (or .cse12 (let ((.cse34 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse1)) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse3 (let ((.cse33 (and .cse30 .cse34))) (and (or .cse10 .cse33) (or .cse29 .cse33)))) (or .cse31 (let ((.cse35 (and (or .cse32 .cse7) .cse34))) (and (or .cse29 .cse35) (or .cse10 .cse35)))))))))) .cse16))))) is different from false [2024-11-09 06:39:25,177 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse36 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse13 (mod (+ .cse36 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse1 (mod .cse36 256))) (let ((.cse15 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (< 127 .cse1)) (.cse4 (= .cse36 0)) (.cse12 (< .cse1 128)) (.cse3 (< 127 .cse13)) (.cse10 (< 127 .cse14)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse8 (< .cse14 .cse2)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (< .cse13 .cse2))) (and (or (and (or .cse0 (< .cse1 .cse2)) (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse8 .cse9 .cse10 .cse7)) .cse11) (or .cse12 (and (or .cse8 .cse9 .cse10 .cse7) (or .cse3 .cse5 .cse6 .cse7))))) .cse15 .cse16) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse2) .cse16) (let ((.cse19 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse24 (<= .cse2 0)) (.cse23 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse21 (+ .cse19 (- 256))) (.cse20 (<= 128 .cse19)) (.cse18 (<= .cse19 127)) (.cse17 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|))) .cse17) (and (or (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|))))) (and .cse20 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse22 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod (+ .cse22 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) .cse23) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse22 0)))))))) .cse24) (and .cse24 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (let ((.cse25 (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= .cse25 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse23 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse25) 256))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod .cse21 |v_ULTIMATE.start_gcd_test_~b#1_36|) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse15)) .cse20) (and .cse18 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))) .cse17)))) (or (let ((.cse27 (= .cse13 0)) (.cse28 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse13) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse30 (or .cse27 .cse7 .cse28)) (.cse31 (< .cse13 128)) (.cse29 (< .cse14 128)) (.cse32 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse13)) .cse2))))) (and (or .cse11 (let ((.cse26 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse1) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse1 0)))) (and (or .cse3 (and (or (and .cse26 (or .cse4 .cse27 .cse7 .cse28)) .cse29) (or (and .cse26 .cse30) .cse10))) (or .cse31 (and (or .cse4 .cse32 .cse7) .cse26))))) (or .cse12 (let ((.cse34 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse1)) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse3 (let ((.cse33 (and .cse30 .cse34))) (and (or .cse10 .cse33) (or .cse29 .cse33)))) (or .cse31 (let ((.cse35 (and (or .cse32 .cse7) .cse34))) (and (or .cse29 .cse35) (or .cse10 .cse35)))))))))) .cse16))))) is different from true [2024-11-09 06:39:28,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse56 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse13 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse1 (mod .cse56 256))) (let ((.cse15 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (< 127 .cse1)) (.cse4 (= .cse56 0)) (.cse12 (< .cse1 128)) (.cse3 (< 127 .cse13)) (.cse10 (< 127 .cse14)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse7 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse16 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse8 (< .cse14 .cse2)) (.cse9 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (< .cse13 .cse2))) (and (or (and (or .cse0 (< .cse1 .cse2)) (or .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse8 .cse9 .cse10 .cse7)) .cse11) (or .cse12 (and (or .cse8 .cse9 .cse10 .cse7) (or .cse3 .cse5 .cse6 .cse7))))) .cse15 .cse16) (let ((.cse26 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse17 (<= .cse2 0)) (.cse24 (<= .cse26 127)) (.cse18 (<= 128 .cse26)) (.cse20 (+ .cse26 (- 256))) (.cse21 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse41 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse17 (or (and .cse18 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse19 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse19 0))))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse21 (mod (+ .cse22 .cse23 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse22 0)) (not (= .cse23 0)))))))) (and .cse24 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25) 0) (not (= .cse25 0))))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= (mod (+ (* 255 .cse28) .cse27) 256) .cse21) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse28 0)))))))))) (and .cse17 (or (and .cse24 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29)) (not (= .cse29 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse31 (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse31))) (and (not (= .cse30 0)) (= (mod (+ (* 255 .cse31) .cse30) 256) .cse21) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse31 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse32 (mod .cse26 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse32) 0) (not (= .cse32 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse15))) (and .cse18 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse35 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse34 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse35 .cse34) 256))))) (and (not (= .cse33 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse34 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse33 .cse35 .cse34) 256) .cse21))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse36 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse36) 256))) 0) (not (= .cse36 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse37 (mod .cse20 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse37) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse37 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse39 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse39))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse38 0)) (= (mod (+ (* .cse39 255) .cse38) 256) .cse21) (not (= .cse39 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse40 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse40 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse40) 0)))))) .cse41) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse43 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse43))) (and (not (= .cse42 0)) (= (mod (+ (* .cse43 255) .cse42) 256) .cse21) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse43 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse44 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse44 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse44) 0)))) .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse45 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse45 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse45) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse41)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse2) .cse16) (or (let ((.cse47 (= .cse13 0)) (.cse48 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse13) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse50 (or .cse47 .cse7 .cse48)) (.cse51 (< .cse13 128)) (.cse49 (< .cse14 128)) (.cse52 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse13)) .cse2))))) (and (or .cse11 (let ((.cse46 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse1) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse1 0)))) (and (or .cse3 (and (or (and .cse46 (or .cse4 .cse47 .cse7 .cse48)) .cse49) (or (and .cse46 .cse50) .cse10))) (or .cse51 (and (or .cse4 .cse52 .cse7) .cse46))))) (or .cse12 (let ((.cse54 (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse1)) .cse2) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse3 (let ((.cse53 (and .cse50 .cse54))) (and (or .cse10 .cse53) (or .cse49 .cse53)))) (or .cse51 (let ((.cse55 (and (or .cse52 .cse7) .cse54))) (and (or .cse49 .cse55) (or .cse10 .cse55)))))))))) .cse16) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse2) .cse16))))) is different from false [2024-11-09 06:39:28,185 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse31 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse10 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= .cse30 0)) (.cse8 (<= .cse10 127)) (.cse1 (<= 128 .cse10)) (.cse3 (+ .cse10 (- 256))) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse25 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse2 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= .cse5 (mod (+ .cse6 .cse7 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (not (= .cse6 0)) (not (= .cse7 0)))))))) (and .cse8 (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse9 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse9) 0) (not (= .cse9 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse12 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse12))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse11 0)) (= (mod (+ (* 255 .cse12) .cse11) 256) .cse5) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse12 0)))))))))) (and .cse0 (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse13 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse13)) (not (= .cse13 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse15 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse15))) (and (not (= .cse14 0)) (= (mod (+ (* 255 .cse15) .cse14) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse15 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse10 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse16) 0) (not (= .cse16 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4))) (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse19 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse18 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse19 .cse18) 256))))) (and (not (= .cse17 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod (+ .cse17 .cse19 .cse18) 256) .cse5))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse20) 256))) 0) (not (= .cse20 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse21 (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse21) 256))) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse23))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse22 0)) (= (mod (+ (* .cse23 255) .cse22) 256) .cse5) (not (= .cse23 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse24 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24) 0)))))) .cse25) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse27 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse27))) (and (not (= .cse26 0)) (= (mod (+ (* .cse27 255) .cse26) 256) .cse5) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse27 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse28 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28) 0)))) .cse4) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse29 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) .cse25)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse31) (or (let ((.cse41 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse43 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod .cse41 256)) (.cse38 (< .cse43 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse40 (< 127 .cse43)) (.cse33 (< 127 .cse42)) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse42 .cse30)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)))) (and (or (let ((.cse34 (= .cse41 0))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37))) (< 127 .cse32)) (or (< .cse32 128) (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))))) .cse31))) is different from true [2024-11-09 06:39:33,805 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse31 (< |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= .cse30 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse2) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse5))) (and (not (= .cse3 0)) (= .cse4 (mod (+ (* .cse5 255) .cse3) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse6 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse6) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) 0) (not (= .cse7 0))))) .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse9 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse10 0)) (= .cse4 (mod (+ (* 255 .cse10) .cse9) 256))))))) .cse11) (and .cse12 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= .cse4 (mod (+ .cse13 .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse13 0)) (not (= .cse14 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse16 0))))) .cse1)))) .cse17) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse18) 256))) |c_ULTIMATE.start_gcd_test_~a#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse21 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= .cse4 (mod (+ .cse19 .cse20 .cse21) 256)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse22) 256))) 0) (not (= .cse22 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) .cse12) (and .cse11 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 .cse24) .cse23) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse25 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26) 0) (not (= .cse26 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse1)))) .cse17) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= .cse4 (mod (+ (* .cse28 255) .cse27) 256)) (not (= .cse28 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) 0)))))) .cse0)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse31) (or (let ((.cse41 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse43 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod .cse41 256)) (.cse38 (< .cse43 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse40 (< 127 .cse43)) (.cse33 (< 127 .cse42)) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse42 .cse30)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)))) (and (or (let ((.cse34 (= .cse41 0))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37))) (< 127 .cse32)) (or (< .cse32 128) (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))))) .cse31))) is different from true [2024-11-09 06:39:56,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:39:58,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:00,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:02,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:05,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:07,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:09,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 06:40:11,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 06:40:14,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:16,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:37,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:39,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:41,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 06:40:44,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:46,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:48,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 06:40:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:40:48,789 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-09 06:40:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:40:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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 13 [2024-11-09 06:40:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:40:48,791 INFO L225 Difference]: With dead ends: 46 [2024-11-09 06:40:48,791 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 06:40:48,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 91.1s TimeCoverageRelationStatistics Valid=128, Invalid=570, Unknown=36, NotChecked=456, Total=1190 [2024-11-09 06:40:48,793 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:40:48,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 170 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 21 Unknown, 218 Unchecked, 38.9s Time] [2024-11-09 06:40:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 06:40:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-09 06:40:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 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) [2024-11-09 06:40:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 06:40:48,810 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 13 [2024-11-09 06:40:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:40:48,810 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 06:40:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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) [2024-11-09 06:40:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 06:40:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 06:40:48,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:40:48,812 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:40:48,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:40:49,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:40:49,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:40:49,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:40:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1619029535, now seen corresponding path program 1 times [2024-11-09 06:40:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:40:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681268384] [2024-11-09 06:40:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:40:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:40:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:40:49,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:40:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:40:49,068 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:40:49,069 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:40:49,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 06:40:49,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 06:40:49,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:40:49,078 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 06:40:49,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:40:49,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:40:49 BoogieIcfgContainer [2024-11-09 06:40:49,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:40:49,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:40:49,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:40:49,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:40:49,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:37:25" (3/4) ... [2024-11-09 06:40:49,111 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:40:49,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:40:49,113 INFO L158 Benchmark]: Toolchain (without parser) took 204581.63ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 158.8MB in the beginning and 235.3MB in the end (delta: -76.5MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,113 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:40:49,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.37ms. Allocated memory is still 190.8MB. Free memory was 158.8MB in the beginning and 145.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.88ms. Allocated memory is still 190.8MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,114 INFO L158 Benchmark]: Boogie Preprocessor took 53.73ms. Allocated memory is still 190.8MB. Free memory was 143.2MB in the beginning and 142.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,115 INFO L158 Benchmark]: RCFGBuilder took 576.30ms. Allocated memory is still 190.8MB. Free memory was 142.0MB in the beginning and 123.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,115 INFO L158 Benchmark]: TraceAbstraction took 203411.66ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 122.7MB in the beginning and 236.3MB in the end (delta: -113.6MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,115 INFO L158 Benchmark]: Witness Printer took 8.63ms. Allocated memory is still 337.6MB. Free memory was 236.3MB in the beginning and 235.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:40:49,117 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 142.6MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.37ms. Allocated memory is still 190.8MB. Free memory was 158.8MB in the beginning and 145.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.88ms. Allocated memory is still 190.8MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.73ms. Allocated memory is still 190.8MB. Free memory was 143.2MB in the beginning and 142.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.30ms. Allocated memory is still 190.8MB. Free memory was 142.0MB in the beginning and 123.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 203411.66ms. Allocated memory was 190.8MB in the beginning and 337.6MB in the end (delta: 146.8MB). Free memory was 122.7MB in the beginning and 236.3MB in the end (delta: -113.6MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 8.63ms. Allocated memory is still 337.6MB. Free memory was 236.3MB in the beginning and 235.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 97. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L93] CALL, EXPR f(IN) VAL [\old(x)=109] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L93] RET, EXPR f(IN) VAL [IN=109] [L93] CALL, EXPR fp(IN) VAL [\old(x)=109] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L93] RET, EXPR fp(IN) VAL [IN=109] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=110] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L95] RET, EXPR f(x) VAL [IN=109, x=110] [L95] CALL, EXPR fp(x) VAL [\old(x)=110] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L95] RET, EXPR fp(x) VAL [IN=109, x=110] [L95] x = x - f(x)/fp(x) [L97] CALL, EXPR f(x) VAL [\old(x)=111] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L97] RET, EXPR f(x) VAL [IN=109, x=111] [L97] CALL, EXPR fp(x) VAL [\old(x)=111] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L97] RET, EXPR fp(x) VAL [IN=109, x=111] [L97] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=109] [L102] reach_error() VAL [IN=109] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 203.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 97.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 39.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 401 SdHoareTripleChecker+Invalid, 36.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 362 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 85 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 101.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 98.6s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 12 QuantifiedInterpolants, 7306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 06:40:49,339 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 06:40:49,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje --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 cdcc8697c8b9bd3a25c95b335058fb611b45ef6a0bd08057dccc283c9b370e3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:40:51,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:40:51,626 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:40:51,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:40:51,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:40:51,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:40:51,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:40:51,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:40:51,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:40:51,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:40:51,687 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:40:51,688 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:40:51,688 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:40:51,689 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:40:51,689 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:40:51,689 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:40:51,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:40:51,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:40:51,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:40:51,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:40:51,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:40:51,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:40:51,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:40:51,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:40:51,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:40:51,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:40:51,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:40:51,699 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:40:51,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:40:51,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:40:51,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:40:51,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:40:51,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:40:51,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:40:51,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:40:51,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:40:51,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:40:51,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:40:51,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:40:51,704 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:40:51,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:40:51,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:40:51,705 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:40:51,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/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_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje 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 -> cdcc8697c8b9bd3a25c95b335058fb611b45ef6a0bd08057dccc283c9b370e3d [2024-11-09 06:40:52,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:40:52,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:40:52,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:40:52,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:40:52,135 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:40:52,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i Unable to find full path for "g++" [2024-11-09 06:40:54,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:40:54,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:40:54,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i [2024-11-09 06:40:54,435 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data/e1405ef80/7d89e13fb0224464bf8d83f013858a68/FLAGb086fe7ef [2024-11-09 06:40:54,456 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/data/e1405ef80/7d89e13fb0224464bf8d83f013858a68 [2024-11-09 06:40:54,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:40:54,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:40:54,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:40:54,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:40:54,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:40:54,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adcf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54, skipping insertion in model container [2024-11-09 06:40:54,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:40:54,743 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[1226,1239] [2024-11-09 06:40:54,787 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[2862,2875] [2024-11-09 06:40:54,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:40:54,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:40:54,831 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[1226,1239] [2024-11-09 06:40:54,850 WARN L250 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_19244e7c-e8fa-4ab0-83cb-870fb9448816/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[2862,2875] [2024-11-09 06:40:54,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:40:54,879 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:40:54,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54 WrapperNode [2024-11-09 06:40:54,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:40:54,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:40:54,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:40:54,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:40:54,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,939 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-09 06:40:54,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:40:54,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:40:54,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:40:54,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:40:54,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:54,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:40:54,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:40:54,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:40:55,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:40:55,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (1/1) ... [2024-11-09 06:40:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:40:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:40:55,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:40:55,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:40:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:40:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 06:40:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 06:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 06:40:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 06:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:40:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:40:55,217 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:40:55,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:41:02,704 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 06:41:02,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:41:02,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:41:02,733 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:41:02,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:41:02 BoogieIcfgContainer [2024-11-09 06:41:02,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:41:02,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:41:02,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:41:02,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:41:02,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:40:54" (1/3) ... [2024-11-09 06:41:02,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54645037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:41:02, skipping insertion in model container [2024-11-09 06:41:02,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:40:54" (2/3) ... [2024-11-09 06:41:02,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54645037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:41:02, skipping insertion in model container [2024-11-09 06:41:02,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:41:02" (3/3) ... [2024-11-09 06:41:02,751 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_4.i [2024-11-09 06:41:02,776 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:41:02,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:41:02,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:41:02,888 INFO L333 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, 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;@79ecf7b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:41:02,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:41:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 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) [2024-11-09 06:41:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:41:02,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:41:02,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:41:02,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:41:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:41:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1594868719, now seen corresponding path program 1 times [2024-11-09 06:41:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:41:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951216407] [2024-11-09 06:41:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:41:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:02,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:41:02,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:41:02,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 06:41:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:41:03,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:41:03,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:03,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:41:03,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:41:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951216407] [2024-11-09 06:41:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951216407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:41:03,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:41:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:41:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094436084] [2024-11-09 06:41:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:41:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:41:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:41:03,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:41:03,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:41:03,275 INFO L87 Difference]: Start difference. First operand has 41 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 32 states have internal predecessors, (41), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:41:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:41:03,481 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2024-11-09 06:41:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:41:03,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:41:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:41:03,494 INFO L225 Difference]: With dead ends: 76 [2024-11-09 06:41:03,494 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 06:41:03,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:41:03,505 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:41:03,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:41:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 06:41:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 06:41:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 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) [2024-11-09 06:41:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-09 06:41:03,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 11 [2024-11-09 06:41:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:41:03,551 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-09 06:41:03,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:41:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-09 06:41:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:41:03,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:41:03,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:41:03,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 06:41:03,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:03,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:41:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:41:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash 180138643, now seen corresponding path program 1 times [2024-11-09 06:41:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:41:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310789457] [2024-11-09 06:41:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:41:03,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:41:03,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:41:03,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 06:41:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:41:03,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:41:03,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:04,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:41:04,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:41:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310789457] [2024-11-09 06:41:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310789457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:41:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:41:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:41:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810231254] [2024-11-09 06:41:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:41:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:41:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:41:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:41:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:41:04,007 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:41:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:41:04,192 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-09 06:41:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:41:04,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:41:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:41:04,198 INFO L225 Difference]: With dead ends: 49 [2024-11-09 06:41:04,198 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 06:41:04,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:41:04,199 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:41:04,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:41:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 06:41:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-09 06:41:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 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) [2024-11-09 06:41:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 06:41:04,211 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 11 [2024-11-09 06:41:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:41:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 06:41:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:41:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 06:41:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:41:04,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:41:04,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:41:04,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:41:04,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:04,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:41:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:41:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash -629207983, now seen corresponding path program 1 times [2024-11-09 06:41:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:41:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911454722] [2024-11-09 06:41:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:41:04,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:04,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:41:04,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:41:04,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 06:41:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:41:04,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:41:04,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:05,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:41:05,155 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:41:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911454722] [2024-11-09 06:41:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911454722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:41:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:41:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:41:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662112239] [2024-11-09 06:41:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:41:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:41:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:41:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:41:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:41:05,170 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:41:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:41:05,465 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-09 06:41:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:41:05,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:41:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:41:05,467 INFO L225 Difference]: With dead ends: 43 [2024-11-09 06:41:05,468 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 06:41:05,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:41:05,470 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:41:05,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 164 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:41:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 06:41:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-09 06:41:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 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) [2024-11-09 06:41:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 06:41:05,482 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 11 [2024-11-09 06:41:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:41:05,483 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 06:41:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:41:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 06:41:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:41:05,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:41:05,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:41:05,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:41:05,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:05,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:41:05,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:41:05,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1552324308, now seen corresponding path program 1 times [2024-11-09 06:41:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:41:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119380877] [2024-11-09 06:41:05,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:41:05,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:05,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:41:05,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:41:05,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 06:41:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:41:05,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:41:05,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:09,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:41:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:17,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:41:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119380877] [2024-11-09 06:41:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119380877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:41:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1647955263] [2024-11-09 06:41:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:41:17,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:41:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:41:17,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:41:17,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 06:41:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:41:18,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:41:18,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:19,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:41:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:20,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1647955263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:41:20,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697234607] [2024-11-09 06:41:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:41:20,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:41:20,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:41:20,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:41:20,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:41:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:41:20,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:41:20,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:41:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:21,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:41:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:41:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697234607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:41:22,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:41:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 10, 10] total 18 [2024-11-09 06:41:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895807765] [2024-11-09 06:41:22,197 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:41:22,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:41:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:41:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:41:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:41:22,199 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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) [2024-11-09 06:41:25,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:41:26,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:41:29,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:41:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:41:30,004 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-09 06:41:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:41:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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 13 [2024-11-09 06:41:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:41:30,006 INFO L225 Difference]: With dead ends: 51 [2024-11-09 06:41:30,006 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 06:41:30,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:41:30,008 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:41:30,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2024-11-09 06:41:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 06:41:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-09 06:41:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 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) [2024-11-09 06:41:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 06:41:30,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 13 [2024-11-09 06:41:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:41:30,017 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 06:41:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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) [2024-11-09 06:41:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 06:41:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:41:30,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:41:30,019 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:41:30,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:41:30,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:41:30,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:41:30,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:41:30,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:41:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:41:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1058982499, now seen corresponding path program 2 times [2024-11-09 06:41:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:41:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937667503] [2024-11-09 06:41:30,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:41:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:41:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:41:30,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:41:30,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 06:41:37,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:41:37,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:41:37,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:41:38,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:44:16,383 WARN L286 SmtUtils]: Spent 16.77s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:44:32,938 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_14| (_ BitVec 8))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_14|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse5))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse3))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (bvsge .cse0 .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))))))))) is different from false [2024-11-09 06:44:34,953 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_14| (_ BitVec 8))) (let ((.cse1 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_14|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse1))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse5))))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse3))))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse1 (_ bv0 32)) (not (bvsge .cse0 .cse2)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))))))))) is different from true [2024-11-09 06:44:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:44:34,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:48:18,850 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:48:38,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_15|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))))) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse3 .cse1) (not (bvsgt .cse3 (_ bv0 32)))))))))) is different from false [2024-11-09 06:48:40,125 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_15| (_ BitVec 8))) (let ((.cse2 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_15|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse2))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse0))))) (or (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse1))))) (not (bvslt .cse2 (_ bv0 32))) (bvsge .cse3 .cse1) (not (bvsgt .cse3 (_ bv0 32)))))))))) is different from true [2024-11-09 06:48:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:48:54,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:48:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937667503] [2024-11-09 06:48:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937667503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:48:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [936142085] [2024-11-09 06:48:54,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:48:54,806 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:48:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:48:54,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:48:54,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 06:48:55,372 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:48:55,373 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:48:55,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 06:48:55,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:22,694 WARN L286 SmtUtils]: Spent 16.82s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:50:39,238 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main1_~x~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_16|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (and (bvslt .cse0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))) (_ bv0 32)) (bvsgt .cse3 (_ bv0 32)) (not (bvsge .cse3 .cse2))))))))) is different from false [2024-11-09 06:50:41,260 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main1_~x~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_gcd_test_~b#1_32| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~b#1_32|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_16|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (and (bvslt .cse0 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))) (_ bv0 32)) (bvsgt .cse3 (_ bv0 32)) (not (bvsge .cse3 .cse2))))))))) is different from true [2024-11-09 06:50:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:41,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:51:14,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_17| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_17|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (not (bvslt .cse0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))))) (not (bvsgt .cse3 (_ bv0 32))) (bvsge .cse3 .cse2)))))))) is different from false [2024-11-09 06:51:16,617 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_17| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_17|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse0))))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse5))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse5 .cse4))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse1))))) (or (not (bvslt .cse0 (_ bv0 32))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse1 .cse2))))) (not (bvsgt .cse3 (_ bv0 32))) (bvsge .cse3 .cse2)))))))) is different from true [2024-11-09 06:51:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [936142085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:51:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410377161] [2024-11-09 06:51:31,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:51:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:51:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:51:31,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:51:31,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19244e7c-e8fa-4ab0-83cb-870fb9448816/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:51:34,992 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:51:34,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:51:35,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:51:35,035 INFO L278 TraceCheckSpWp]: Computing forward predicates...