./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:18:14,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:18:14,178 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:18:14,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:18:14,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:18:14,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:18:14,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:18:14,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:18:14,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:18:14,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:18:14,252 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:18:14,252 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:18:14,254 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:18:14,272 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:18:14,273 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:18:14,273 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:18:14,274 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:18:14,276 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:18:14,277 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:18:14,281 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:18:14,281 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:18:14,282 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:18:14,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:18:14,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:18:14,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:18:14,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:18:14,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:18:14,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:18:14,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:18:14,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:18:14,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:18:14,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:18:14,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:18:14,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:18:14,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:18:14,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:18:14,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:18:14,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:18:14,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:18:14,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:18:14,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:18:14,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:18:14,294 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:18:14,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:18:14,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:18:14,295 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:18:14,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:18:14,296 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2024-11-09 01:18:14,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:18:14,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:18:14,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:18:14,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:18:14,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:18:14,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i Unable to find full path for "g++" [2024-11-09 01:18:16,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:18:16,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:18:16,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2024-11-09 01:18:16,775 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data/b88bab8d9/4d3fedf4119e43c78cda0f19bda35f48/FLAGf8812e3bc [2024-11-09 01:18:17,152 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data/b88bab8d9/4d3fedf4119e43c78cda0f19bda35f48 [2024-11-09 01:18:17,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:18:17,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:18:17,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:17,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:18:17,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:18:17,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb72ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17, skipping insertion in model container [2024-11-09 01:18:17,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:18:17,409 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2024-11-09 01:18:17,442 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2024-11-09 01:18:17,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:17,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:18:17,469 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2024-11-09 01:18:17,483 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2024-11-09 01:18:17,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:17,506 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:18:17,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17 WrapperNode [2024-11-09 01:18:17,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:17,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:17,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:18:17,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:18:17,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,547 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-09 01:18:17,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:17,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:18:17,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:18:17,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:18:17,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:18:17,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:18:17,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:18:17,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:18:17,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (1/1) ... [2024-11-09 01:18:17,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:18:17,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:17,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:18:17,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:18:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:18:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 01:18:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 01:18:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 01:18:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 01:18:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:18:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:18:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:18:17,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:18:17,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:18:17,959 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 01:18:17,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:18:18,045 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:18:18,045 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:18:18,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:18 BoogieIcfgContainer [2024-11-09 01:18:18,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:18:18,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:18:18,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:18:18,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:18:18,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:18:17" (1/3) ... [2024-11-09 01:18:18,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfa1946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:18, skipping insertion in model container [2024-11-09 01:18:18,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:17" (2/3) ... [2024-11-09 01:18:18,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfa1946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:18, skipping insertion in model container [2024-11-09 01:18:18,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:18" (3/3) ... [2024-11-09 01:18:18,062 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2024-11-09 01:18:18,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:18:18,082 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 01:18:18,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:18:18,145 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;@5c2397d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:18:18,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 01:18:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:18:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 01:18:18,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:18,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:18,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1074225707, now seen corresponding path program 1 times [2024-11-09 01:18:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980872931] [2024-11-09 01:18:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:18,763 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 01:18:18,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980872931] [2024-11-09 01:18:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980872931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:18:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532145902] [2024-11-09 01:18:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:18:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:18:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:18:18,797 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.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 01:18:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:18,900 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-09 01:18:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:18:18,903 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 01:18:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:18,911 INFO L225 Difference]: With dead ends: 39 [2024-11-09 01:18:18,912 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 01:18:18,916 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 01:18:18,921 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 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 01:18:18,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:18:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 01:18:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 01:18:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:18:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 01:18:18,958 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-11-09 01:18:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:18,959 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 01:18:18,959 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 01:18:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 01:18:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 01:18:18,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:18,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:18:18,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:18:18,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:18,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:18,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1198724816, now seen corresponding path program 1 times [2024-11-09 01:18:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:18:18,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856078005] [2024-11-09 01:18:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:18,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:18:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:18:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595986636] [2024-11-09 01:18:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:19,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:18:19,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:18:19,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:18:19,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:18:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:19,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:18:19,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:22,991 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 01:18:29,487 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 01:18:32,792 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 01:18:32,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:18:42,916 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 01:18:42,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:18:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856078005] [2024-11-09 01:18:42,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:18:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595986636] [2024-11-09 01:18:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595986636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:18:42,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11597437] [2024-11-09 01:18:42,952 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 01:18:42,952 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:18:42,956 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:18:42,964 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:18:42,965 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:18:44,223 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:18:50,866 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 01:18:50,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:18:50,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:18:50,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-09 01:18:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251120935] [2024-11-09 01:18:50,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:18:50,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:18:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:18:50,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:18:50,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=190, Unknown=7, NotChecked=58, Total=306 [2024-11-09 01:18:50,871 INFO L87 Difference]: Start difference. First operand 24 states and 27 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 01:18:53,363 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 [0] [2024-11-09 01:18:55,886 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 [0] [2024-11-09 01:18:59,189 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 01:19:01,224 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 [0] [2024-11-09 01:19:04,115 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 [0] [2024-11-09 01:19:13,249 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 [0] [2024-11-09 01:19:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:13,849 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 01:19:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:19:13,850 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 01:19:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:13,851 INFO L225 Difference]: With dead ends: 34 [2024-11-09 01:19:13,851 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 01:19:13,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=9, NotChecked=96, Total=380 [2024-11-09 01:19:13,853 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:13,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 9 Unknown, 87 Unchecked, 13.9s Time] [2024-11-09 01:19:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 01:19:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 01:19:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:19:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-09 01:19:13,863 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 9 [2024-11-09 01:19:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:13,863 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 01:19:13,864 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 01:19:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-09 01:19:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 01:19:13,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:13,865 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:13,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:19:14,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:14,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:14,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1228259416, now seen corresponding path program 1 times [2024-11-09 01:19:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:14,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970519386] [2024-11-09 01:19:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:14,143 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 01:19:14,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:19:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970519386] [2024-11-09 01:19:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970519386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:19:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257274172] [2024-11-09 01:19:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:19:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:14,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:19:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:19:14,146 INFO L87 Difference]: Start difference. First operand 27 states and 30 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 01:19:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:14,257 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 01:19:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:19:14,257 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 01:19:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:14,258 INFO L225 Difference]: With dead ends: 32 [2024-11-09 01:19:14,258 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 01:19:14,259 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 01:19:14,260 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 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 01:19:14,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:19:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 01:19:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 01:19:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:19:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 01:19:14,270 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2024-11-09 01:19:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:14,271 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 01:19:14,271 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 01:19:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 01:19:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:19:14,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:14,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:19:14,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:14,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1850413146, now seen corresponding path program 2 times [2024-11-09 01:19:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:19:14,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129454774] [2024-11-09 01:19:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:19:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [914587092] [2024-11-09 01:19:14,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:19:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:19:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:19:14,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:19:14,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:19:14,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 01:19:14,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:19:14,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:19:14,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:19,971 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 01:19:21,170 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 01:19:30,501 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 01:19:37,704 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 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)))) is different from true [2024-11-09 01:19:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-09 01:19:49,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:20:30,321 WARN L286 SmtUtils]: Spent 8.73s 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 01:20:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:20:49,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:20:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129454774] [2024-11-09 01:20:49,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:20:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914587092] [2024-11-09 01:20:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914587092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:20:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012719702] [2024-11-09 01:20:49,696 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 01:20:49,697 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:20:49,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:20:49,697 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:20:49,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:20:50,040 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:20:52,157 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '449#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 01:20:52,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:20:52,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:20:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 01:20:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293965482] [2024-11-09 01:20:52,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:20:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:20:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:20:52,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:20:52,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=255, Unknown=9, NotChecked=140, Total=462 [2024-11-09 01:20:52,160 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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 01:20:53,247 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 01:20:55,898 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 01:21:02,369 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 01:21:02,585 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 ((.cse50 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse51 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse45 (mod .cse56 256))) (let ((.cse44 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse35 (= .cse56 0)) (.cse32 (< 127 .cse45)) (.cse46 (< .cse45 128)) (.cse41 (< 127 .cse51)) (.cse33 (< 127 .cse50)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.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 ((.cse36 (= .cse50 0)) (.cse38 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) .cse30) (< |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 ((.cse40 (or .cse36 .cse37 .cse38)) (.cse42 (< .cse50 128)) (.cse39 (< .cse51 128)) (.cse43 (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) .cse50)) .cse30))))) (and (or .cse32 (let ((.cse34 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse45) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse45 0)))) (and (or .cse33 (and (or (and .cse34 (or .cse35 .cse36 .cse37 .cse38)) .cse39) (or (and .cse34 .cse40) .cse41))) (or .cse42 (and (or .cse35 .cse43 .cse37) .cse34))))) (or .cse46 (let ((.cse48 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse45)) .cse30) (< |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 .cse33 (let ((.cse47 (and .cse40 .cse48))) (and (or .cse41 .cse47) (or .cse39 .cse47)))) (or .cse42 (let ((.cse49 (and (or .cse43 .cse37) .cse48))) (and (or .cse39 .cse49) (or .cse41 .cse49)))))))))) .cse31) (or (let ((.cse54 (< .cse51 .cse30)) (.cse55 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse52 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse53 (< .cse50 .cse30))) (and (or (and (or .cse44 (< .cse45 .cse30)) (or .cse33 .cse35 .cse52 .cse53 .cse37) (or .cse35 .cse54 .cse55 .cse41 .cse37)) .cse32) (or .cse46 (and (or .cse54 .cse55 .cse41 .cse37) (or .cse33 .cse52 .cse53 .cse37))))) .cse31))))) is different from false [2024-11-09 01:21:02,602 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse56 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse51 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse45 (mod .cse56 256))) (let ((.cse44 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse35 (= .cse56 0)) (.cse32 (< 127 .cse45)) (.cse46 (< .cse45 128)) (.cse41 (< 127 .cse51)) (.cse33 (< 127 .cse50)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.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 ((.cse36 (= .cse50 0)) (.cse38 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) .cse30) (< |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 ((.cse40 (or .cse36 .cse37 .cse38)) (.cse42 (< .cse50 128)) (.cse39 (< .cse51 128)) (.cse43 (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) .cse50)) .cse30))))) (and (or .cse32 (let ((.cse34 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse45) .cse30) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse45 0)))) (and (or .cse33 (and (or (and .cse34 (or .cse35 .cse36 .cse37 .cse38)) .cse39) (or (and .cse34 .cse40) .cse41))) (or .cse42 (and (or .cse35 .cse43 .cse37) .cse34))))) (or .cse46 (let ((.cse48 (or .cse44 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse45)) .cse30) (< |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 .cse33 (let ((.cse47 (and .cse40 .cse48))) (and (or .cse41 .cse47) (or .cse39 .cse47)))) (or .cse42 (let ((.cse49 (and (or .cse43 .cse37) .cse48))) (and (or .cse39 .cse49) (or .cse41 .cse49)))))))))) .cse31) (or (let ((.cse54 (< .cse51 .cse30)) (.cse55 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse52 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse53 (< .cse50 .cse30))) (and (or (and (or .cse44 (< .cse45 .cse30)) (or .cse33 .cse35 .cse52 .cse53 .cse37) (or .cse35 .cse54 .cse55 .cse41 .cse37)) .cse32) (or .cse46 (and (or .cse54 .cse55 .cse41 .cse37) (or .cse33 .cse52 .cse53 .cse37))))) .cse31))))) is different from true [2024-11-09 01:21:02,656 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse43 (< |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 (let ((.cse40 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse40 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse42 (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse31 (mod .cse40 256)) (.cse37 (< .cse42 .cse30)) (.cse38 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse39 (< 127 .cse42)) (.cse32 (< 127 .cse41)) (.cse34 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse35 (< .cse41 .cse30)) (.cse36 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)))) (and (or (let ((.cse33 (= .cse40 0))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< .cse31 .cse30)) (or .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse33 .cse37 .cse38 .cse39 .cse36))) (< 127 .cse31)) (or (< .cse31 128) (and (or .cse37 .cse38 .cse39 .cse36) (or .cse32 .cse34 .cse35 .cse36))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse43) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse43) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse43))) is different from true [2024-11-09 01:21:21,101 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 01:21:23,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:21:25,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:21:29,007 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 01:21:31,213 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 01:21:33,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:21:35,626 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 01:21:37,833 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 01:21:39,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:22:09,146 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 01:22:11,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:22:13,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:22:15,713 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 01:22:17,986 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 01:22:20,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 01:22:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:20,180 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-09 01:22:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 01:22:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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 01:22:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:20,182 INFO L225 Difference]: With dead ends: 41 [2024-11-09 01:22:20,182 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 01:22:20,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 96.7s TimeCoverageRelationStatistics Valid=108, Invalid=491, Unknown=33, NotChecked=424, Total=1056 [2024-11-09 01:22:20,184 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:22:20,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 27 Unknown, 209 Unchecked, 36.4s Time] [2024-11-09 01:22:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 01:22:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-09 01:22:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:22:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-09 01:22:20,207 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2024-11-09 01:22:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:20,208 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-09 01:22:20,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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 01:22:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-09 01:22:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:22:20,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:20,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:20,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:22:20,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:20,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash 235847532, now seen corresponding path program 1 times [2024-11-09 01:22:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:22:20,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021989075] [2024-11-09 01:22:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:22:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:22:20,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:22:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:22:20,457 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:22:20,458 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:22:20,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 01:22:20,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 01:22:20,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:22:20,467 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 01:22:20,494 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:22:20,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:22:20 BoogieIcfgContainer [2024-11-09 01:22:20,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:22:20,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:22:20,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:22:20,503 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:22:20,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:18" (3/4) ... [2024-11-09 01:22:20,508 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:22:20,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:22:20,512 INFO L158 Benchmark]: Toolchain (without parser) took 243355.58ms. Allocated memory was 125.8MB in the beginning and 207.6MB in the end (delta: 81.8MB). Free memory was 63.2MB in the beginning and 56.0MB in the end (delta: 7.2MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-11-09 01:22:20,512 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:22:20,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.05ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 63.1MB in the beginning and 136.1MB in the end (delta: -73.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-09 01:22:20,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 133.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:22:20,513 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 172.0MB. Free memory was 133.9MB in the beginning and 132.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:22:20,514 INFO L158 Benchmark]: RCFGBuilder took 473.16ms. Allocated memory is still 172.0MB. Free memory was 131.9MB in the beginning and 130.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 01:22:20,514 INFO L158 Benchmark]: TraceAbstraction took 242450.03ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 129.4MB in the beginning and 57.1MB in the end (delta: 72.3MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-09 01:22:20,514 INFO L158 Benchmark]: Witness Printer took 8.39ms. Allocated memory is still 207.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:22:20,518 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.31ms. Allocated memory is still 125.8MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.05ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 63.1MB in the beginning and 136.1MB in the end (delta: -73.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 133.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 172.0MB. Free memory was 133.9MB in the beginning and 132.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.16ms. Allocated memory is still 172.0MB. Free memory was 131.9MB in the beginning and 130.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 242450.03ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 129.4MB in the beginning and 57.1MB in the end (delta: 72.3MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 8.39ms. Allocated memory is still 207.6MB. Free memory is still 56.0MB. There was no memory consumed. 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 95. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -1.0f && IN < 1.0f) [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) [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, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 242.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 111.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 50.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 344 SdHoareTripleChecker+Invalid, 45.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 296 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 64 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 131.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 39, 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.3s SatisfiabilityAnalysisTime, 119.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 12 QuantifiedInterpolants, 7303 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 01:22:20,733 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 01:22:20,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:22:23,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:22:23,206 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:22:23,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:22:23,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:22:23,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:22:23,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:22:23,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:22:23,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:22:23,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:22:23,266 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:22:23,266 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:22:23,267 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:22:23,267 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:22:23,268 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:22:23,268 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:22:23,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:22:23,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:22:23,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:22:23,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:22:23,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:22:23,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:22:23,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:22:23,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:22:23,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:22:23,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:22:23,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:22:23,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:22:23,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:22:23,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:22:23,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:22:23,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:22:23,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:22:23,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:22:23,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:22:23,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:22:23,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:22:23,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:22:23,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:22:23,282 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:22:23,282 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:22:23,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:22:23,283 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:22:23,283 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2024-11-09 01:22:23,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:22:23,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:22:23,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:22:23,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:22:23,786 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:22:23,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i Unable to find full path for "g++" [2024-11-09 01:22:25,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:22:26,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:22:26,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2024-11-09 01:22:26,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data/020b47e9f/09f6fb97af8f4c3399a6c9395bcd3499/FLAG9d854a22e [2024-11-09 01:22:26,412 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/data/020b47e9f/09f6fb97af8f4c3399a6c9395bcd3499 [2024-11-09 01:22:26,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:22:26,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:22:26,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:22:26,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:22:26,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:22:26,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:26,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ccb240b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26, skipping insertion in model container [2024-11-09 01:22:26,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:26,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:22:26,727 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2024-11-09 01:22:26,776 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2024-11-09 01:22:26,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:22:26,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:22:26,863 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2024-11-09 01:22:26,902 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_1a2d0005-337f-46e2-b895-b3baabe0c0a3/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2024-11-09 01:22:26,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:22:26,978 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:22:26,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26 WrapperNode [2024-11-09 01:22:26,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:22:26,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:22:26,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:22:26,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:22:26,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,048 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-09 01:22:27,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:22:27,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:22:27,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:22:27,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:22:27,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:22:27,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:22:27,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:22:27,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:22:27,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (1/1) ... [2024-11-09 01:22:27,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:22:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:27,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:22:27,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:22:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:22:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:22:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 01:22:27,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 01:22:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 01:22:27,203 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 01:22:27,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:22:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:22:27,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:22:27,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:22:35,260 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 01:22:35,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:22:35,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:22:35,274 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:22:35,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:22:35 BoogieIcfgContainer [2024-11-09 01:22:35,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:22:35,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:22:35,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:22:35,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:22:35,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:22:26" (1/3) ... [2024-11-09 01:22:35,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8c3018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:22:35, skipping insertion in model container [2024-11-09 01:22:35,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:22:26" (2/3) ... [2024-11-09 01:22:35,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8c3018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:22:35, skipping insertion in model container [2024-11-09 01:22:35,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:22:35" (3/3) ... [2024-11-09 01:22:35,284 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2024-11-09 01:22:35,310 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:22:35,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 01:22:35,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:22:35,387 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;@613d1a52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:22:35,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 01:22:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:22:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:22:35,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:35,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:35,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:35,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1594868719, now seen corresponding path program 1 times [2024-11-09 01:22:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:22:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888337806] [2024-11-09 01:22:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:35,418 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 01:22:35,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:22:35,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:35,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:35,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:22:35,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:35,733 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 01:22:35,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:22:35,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:22:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888337806] [2024-11-09 01:22:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888337806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:22:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:22:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:22:35,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411226276] [2024-11-09 01:22:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:22:35,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:22:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:22:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:22:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:22:35,771 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 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 01:22:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:36,000 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 01:22:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:22:36,005 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 01:22:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:36,013 INFO L225 Difference]: With dead ends: 70 [2024-11-09 01:22:36,013 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 01:22:36,017 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 01:22:36,021 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 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 01:22:36,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:22:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 01:22:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 01:22:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:22:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 01:22:36,064 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-09 01:22:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:36,065 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 01:22:36,065 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 01:22:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 01:22:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:22:36,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:36,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:36,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:36,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:36,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:36,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 180138643, now seen corresponding path program 1 times [2024-11-09 01:22:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:22:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693828786] [2024-11-09 01:22:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:36,276 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 01:22:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:22:36,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:36,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:36,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:22:36,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:36,535 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 01:22:36,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:22:36,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:22:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693828786] [2024-11-09 01:22:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693828786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:22:36,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:22:36,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:22:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791853162] [2024-11-09 01:22:36,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:22:36,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:22:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:22:36,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:22:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:22:36,541 INFO L87 Difference]: Start difference. First operand 32 states and 37 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 01:22:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:36,736 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 01:22:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:22:36,737 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 01:22:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:36,738 INFO L225 Difference]: With dead ends: 46 [2024-11-09 01:22:36,739 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 01:22:36,739 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 01:22:36,741 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 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 01:22:36,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:22:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 01:22:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-09 01:22:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:22:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 01:22:36,755 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 01:22:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:36,755 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 01:22:36,756 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 01:22:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 01:22:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:22:36,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:36,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:36,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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)] Ended with exit code 0 [2024-11-09 01:22:36,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:36,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -629207983, now seen corresponding path program 1 times [2024-11-09 01:22:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:22:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563533200] [2024-11-09 01:22:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:36,961 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 01:22:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:22:36,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:36,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:37,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:22:37,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:37,666 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 01:22:37,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:22:37,667 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:22:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563533200] [2024-11-09 01:22:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563533200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:22:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:22:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:22:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756220212] [2024-11-09 01:22:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:22:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:22:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:22:37,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:22:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:22:37,674 INFO L87 Difference]: Start difference. First operand 32 states and 36 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 01:22:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:22:38,029 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 01:22:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:22:38,031 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 01:22:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:22:38,034 INFO L225 Difference]: With dead ends: 40 [2024-11-09 01:22:38,034 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 01:22:38,036 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 01:22:38,039 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 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 01:22:38,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:22:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 01:22:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 01:22:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:22:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 01:22:38,056 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 01:22:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:22:38,057 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 01:22:38,057 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 01:22:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 01:22:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 01:22:38,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:22:38,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:22:38,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:38,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:38,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:22:38,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:22:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1552324308, now seen corresponding path program 1 times [2024-11-09 01:22:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:22:38,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127701074] [2024-11-09 01:22:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:38,262 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 01:22:38,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:22:38,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:38,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:22:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:38,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:22:38,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:42,649 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 01:22:42,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:22:51,457 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 01:22:51,457 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:22:51,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127701074] [2024-11-09 01:22:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127701074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:22:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1532678989] [2024-11-09 01:22:51,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:51,458 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:22:51,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:22:51,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:22:51,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 01:22:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:51,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:22:51,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:52,827 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 01:22:52,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:22:53,825 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 01:22:53,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1532678989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:22:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724763381] [2024-11-09 01:22:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:22:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:53,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:22:53,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:22:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:54,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:22:54,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:55,667 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 01:22:55,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:22:56,855 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 01:22:56,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724763381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:22:56,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:22:56,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 10, 10] total 18 [2024-11-09 01:22:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388770005] [2024-11-09 01:22:56,857 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:22:56,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 01:22:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:22:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 01:22:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:22:56,860 INFO L87 Difference]: Start difference. First operand 32 states and 36 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 01:23:01,169 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 [] [2024-11-09 01:23:03,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:23:04,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:23:07,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 01:23:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:08,099 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-09 01:23:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:23:08,100 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 01:23:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:08,101 INFO L225 Difference]: With dead ends: 48 [2024-11-09 01:23:08,102 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 01:23:08,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:23:08,103 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:08,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 289 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2024-11-09 01:23:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 01:23:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-09 01:23:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 01:23:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 01:23:08,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 13 [2024-11-09 01:23:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:08,113 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 01:23:08,113 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 01:23:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 01:23:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 01:23:08,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:08,115 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:08,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:23:08,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:23:08,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:23:08,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 01:23:08,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:08,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1058982499, now seen corresponding path program 2 times [2024-11-09 01:23:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:23:08,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087523935] [2024-11-09 01:23:08,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:23:08,718 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 01:23:08,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:23:08,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:23:08,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/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 01:23:15,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:23:15,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:23:15,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:23:15,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:25:40,459 WARN L286 SmtUtils]: Spent 16.50s 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 01:25:57,032 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 01:25:59,048 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 01:25:59,049 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 01:25:59,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:19,209 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 01:30:21,239 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 01:30:36,247 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 01:30:36,247 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:30:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087523935] [2024-11-09 01:30:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087523935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:30:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1539019350] [2024-11-09 01:30:36,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:30:36,248 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:30:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:30:36,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:30:36,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 01:30:37,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:30:37,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:30:37,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:30:37,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:08,892 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 01:32:25,872 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 01:32:27,909 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 01:32:27,910 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 01:32:27,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:03,813 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 01:33:05,838 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 01:33:20,742 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 01:33:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1539019350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:33:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486613979] [2024-11-09 01:33:20,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 01:33:20,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:33:20,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:33:20,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a2d0005-337f-46e2-b895-b3baabe0c0a3/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:33:26,103 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 01:33:26,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:33:26,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:33:26,131 INFO L278 TraceCheckSpWp]: Computing forward predicates...