./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_8.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_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 4c99a7d37e4951c8ef9fe39502528fd8fe86fdb39a219c9a8916753f22b09b28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:30:36,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:30:36,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:30:36,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:30:36,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:30:36,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:30:36,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:30:36,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:30:36,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:30:36,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:30:36,244 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:30:36,244 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:30:36,245 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:30:36,245 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:30:36,245 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:30:36,246 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:30:36,246 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:30:36,246 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:30:36,247 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:30:36,247 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:30:36,248 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:30:36,248 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:30:36,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:30:36,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:30:36,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:30:36,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:30:36,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:30:36,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:30:36,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:30:36,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:30:36,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:30:36,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:30:36,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:30:36,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:30:36,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:30:36,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:30:36,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:30:36,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:30:36,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:36,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:30:36,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:30:36,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:30:36,261 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:30:36,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:30:36,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:30:36,261 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:30:36,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:30:36,262 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 -> 4c99a7d37e4951c8ef9fe39502528fd8fe86fdb39a219c9a8916753f22b09b28 [2024-11-09 04:30:36,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:30:36,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:30:36,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:30:36,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:30:36,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:30:36,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_8.i Unable to find full path for "g++" [2024-11-09 04:30:38,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:30:38,573 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 04:30:38,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:30:38,749 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i [2024-11-09 04:30:38,757 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data/cfe0390e6/7e6b548673a349f0892f88fa55f0d1aa/FLAG807471ad6 [2024-11-09 04:30:39,139 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data/cfe0390e6/7e6b548673a349f0892f88fa55f0d1aa [2024-11-09 04:30:39,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:30:39,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:30:39,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:39,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:30:39,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:30:39,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bfa140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39, skipping insertion in model container [2024-11-09 04:30:39,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:30:39,424 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[1226,1239] [2024-11-09 04:30:39,463 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[2841,2854] [2024-11-09 04:30:39,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:39,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:30:39,490 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[1226,1239] [2024-11-09 04:30:39,508 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[2841,2854] [2024-11-09 04:30:39,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:39,532 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:30:39,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39 WrapperNode [2024-11-09 04:30:39,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:39,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:39,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:30:39,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:30:39,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,570 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-09 04:30:39,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:39,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:30:39,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:30:39,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:30:39,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:30:39,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:30:39,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:30:39,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:30:39,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (1/1) ... [2024-11-09 04:30:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:39,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:30:39,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:30:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:30:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 04:30:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 04:30:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 04:30:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 04:30:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:30:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:30:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:30:39,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:30:39,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:30:39,944 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 04:30:39,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:30:40,015 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:30:40,015 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:30:40,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:40 BoogieIcfgContainer [2024-11-09 04:30:40,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:30:40,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:30:40,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:30:40,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:30:40,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:30:39" (1/3) ... [2024-11-09 04:30:40,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e838b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:40, skipping insertion in model container [2024-11-09 04:30:40,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:39" (2/3) ... [2024-11-09 04:30:40,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e838b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:40, skipping insertion in model container [2024-11-09 04:30:40,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:40" (3/3) ... [2024-11-09 04:30:40,035 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_8.i [2024-11-09 04:30:40,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:30:40,059 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 04:30:40,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:30:40,135 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;@31eb6dc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:30:40,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 04:30:40,140 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 04:30:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 04:30:40,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:40,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:40,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1074225707, now seen corresponding path program 1 times [2024-11-09 04:30:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:40,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717042960] [2024-11-09 04:30:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:40,690 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 04:30:40,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717042960] [2024-11-09 04:30:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717042960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:30:40,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866606331] [2024-11-09 04:30:40,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:40,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:40,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:40,728 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 04:30:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:40,851 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-09 04:30:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:30:40,854 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 04:30:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:40,861 INFO L225 Difference]: With dead ends: 39 [2024-11-09 04:30:40,862 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 04:30:40,865 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 04:30:40,872 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 04:30:40,876 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 04:30:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 04:30:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 04:30:40,922 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 04:30:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-09 04:30:40,927 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-11-09 04:30:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 04:30:40,928 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 04:30:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-09 04:30:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 04:30:40,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:40,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:30:40,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1198724816, now seen corresponding path program 1 times [2024-11-09 04:30:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345329357] [2024-11-09 04:30:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:41,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487570492] [2024-11-09 04:30:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:41,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:41,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:30:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:41,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 04:30:41,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:44,971 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 04:30:48,008 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse5 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse4 (<= 128 .cse2)) (.cse3 (+ .cse2 (- 256))) (.cse1 (<= .cse2 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (= (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))) .cse0) (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_24|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_24| 1) 0) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0))) .cse4)) .cse5) (and .cse5 (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (= (mod .cse3 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|)))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_24| Int)) (and (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_24|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_24|) (<= |v_ULTIMATE.start_gcd_test_~b#1_24| 127) (not (= |v_ULTIMATE.start_gcd_test_~b#1_24| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_24|))))))))) is different from true [2024-11-09 04:30:54,821 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 04:30:54,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:04,729 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 04:31:04,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345329357] [2024-11-09 04:31:04,731 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:31:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487570492] [2024-11-09 04:31:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487570492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [862605831] [2024-11-09 04:31:04,755 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 04:31:04,755 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:04,758 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:04,765 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:04,766 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:05,743 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:11,384 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 04:31:11,384 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:11,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:31:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-09 04:31:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705893395] [2024-11-09 04:31:11,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:11,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:31:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:31:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=5, NotChecked=58, Total=306 [2024-11-09 04:31:11,389 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 04:31:13,908 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 04:31:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:24,617 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 04:31:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:31:24,618 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 04:31:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:24,618 INFO L225 Difference]: With dead ends: 34 [2024-11-09 04:31:24,618 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 04:31:24,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=9, NotChecked=96, Total=380 [2024-11-09 04:31:24,620 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:24,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 1 Unknown, 88 Unchecked, 0.7s Time] [2024-11-09 04:31:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 04:31:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 04:31:24,628 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 04:31:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-09 04:31:24,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 9 [2024-11-09 04:31:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:24,630 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 04:31:24,630 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 04:31:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-09 04:31:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 04:31:24,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:24,631 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:24,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:31:24,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:24,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:24,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1228259416, now seen corresponding path program 1 times [2024-11-09 04:31:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580734266] [2024-11-09 04:31:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:24,928 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 04:31:24,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:24,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580734266] [2024-11-09 04:31:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580734266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:31:24,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:31:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:31:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765089019] [2024-11-09 04:31:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:31:24,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:31:24,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:31:24,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:31:24,935 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 04:31:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:25,050 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 04:31:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:31:25,051 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 04:31:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:25,052 INFO L225 Difference]: With dead ends: 32 [2024-11-09 04:31:25,052 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 04:31:25,052 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 04:31:25,054 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 04:31:25,054 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 04:31:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 04:31:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 04:31:25,062 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 04:31:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 04:31:25,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2024-11-09 04:31:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:25,063 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 04:31:25,063 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 04:31:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 04:31:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:31:25,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:25,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:25,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:31:25,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:25,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:25,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1850413146, now seen corresponding path program 2 times [2024-11-09 04:31:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:25,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052613460] [2024-11-09 04:31:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:31:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750544888] [2024-11-09 04:31:25,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:31:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:25,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:25,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:31:25,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 04:31:25,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:31:25,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 04:31:25,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:32,041 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 04:31:50,638 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 04:32:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 04:32:06,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:32:56,132 WARN L286 SmtUtils]: Spent 8.70s 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 04:33:02,117 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse18 (mod (+ .cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse19 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse4 (= .cse18 0)) (.cse5 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse18) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse1 (< 127 .cse18)) (.cse8 (or .cse4 .cse5 .cse6)) (.cse10 (< .cse18 128)) (.cse7 (< .cse19 128)) (.cse9 (< 127 .cse19)) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse18)) .cse13)))) (.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (mod .cse14 256))) (and (or (< 127 .cse0) (let ((.cse3 (= .cse14 0)) (.cse2 (or .cse12 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse0) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse0 0)))) (and (or .cse1 (and (or (and .cse2 (or .cse3 .cse4 .cse5 .cse6)) .cse7) (or (and .cse2 .cse8) .cse9))) (or .cse10 (and (or .cse3 .cse11 .cse5) .cse2))))) (or (< .cse0 128) (let ((.cse16 (or .cse12 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse0)) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse1 (let ((.cse15 (and .cse8 .cse16))) (and (or .cse9 .cse15) (or .cse7 .cse15)))) (or .cse10 (let ((.cse17 (and (or .cse11 .cse5) .cse16))) (and (or .cse7 .cse17) (or .cse9 .cse17)))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) is different from false [2024-11-09 04:33:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 04:33:02,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:33:02,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052613460] [2024-11-09 04:33:02,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:33:02,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750544888] [2024-11-09 04:33:02,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750544888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:33:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1849245706] [2024-11-09 04:33:02,333 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2024-11-09 04:33:02,333 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:33:02,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:33:02,334 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:33:02,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:33:02,684 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:33:11,985 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '450#(<= 1 |#StackHeapBarrier|)' at error location [2024-11-09 04:33:11,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:33:11,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:33:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-09 04:33:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225240566] [2024-11-09 04:33:11,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:33:11,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 04:33:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:33:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 04:33:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=304, Unknown=22, NotChecked=114, Total=506 [2024-11-09 04:33:11,988 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:33:15,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ .cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse19 (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse4 (= .cse18 0)) (.cse5 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse18) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))))) (let ((.cse1 (< 127 .cse18)) (.cse8 (or .cse4 .cse5 .cse6)) (.cse10 (< .cse18 128)) (.cse7 (< .cse19 128)) (.cse9 (< 127 .cse19)) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0) (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse18)) .cse13)))) (.cse12 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (mod .cse14 256))) (and (or (< 127 .cse0) (let ((.cse3 (= .cse14 0)) (.cse2 (or .cse12 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse0) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0))) (= .cse0 0)))) (and (or .cse1 (and (or (and .cse2 (or .cse3 .cse4 .cse5 .cse6)) .cse7) (or (and .cse2 .cse8) .cse9))) (or .cse10 (and (or .cse3 .cse11 .cse5) .cse2))))) (or (< .cse0 128) (let ((.cse16 (or .cse12 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse0)) .cse13) (< |c_ULTIMATE.start_gcd_test_~b#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (< |v_ULTIMATE.start_gcd_test_~a#1_31| 0)))))) (and (or .cse1 (let ((.cse15 (and .cse8 .cse16))) (and (or .cse9 .cse15) (or .cse7 .cse15)))) (or .cse10 (let ((.cse17 (and (or .cse11 .cse5) .cse16))) (and (or .cse7 .cse17) (or .cse9 .cse17)))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) (or (and (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (and (let ((.cse20 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (or (and (<= 128 .cse20) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse20)) (and (= .cse20 |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse20 127)))) (<= .cse13 0))) (or (and (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) (and (<= (+ |c_ULTIMATE.start_gcd_test_~b#1| 1) 0) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128)))))) is different from false [2024-11-09 04:33:20,115 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 [0] [2024-11-09 04:33:30,073 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 [0] [2024-11-09 04:33:44,821 WARN L286 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 169 DAG size of output: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 04:33:47,462 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 04:33:48,258 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 ((.cse44 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse43 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse32 (mod .cse56 256))) (let ((.cse41 (< 127 .cse32)) (.cse34 (= .cse56 0)) (.cse42 (< .cse32 128)) (.cse33 (< 127 .cse43)) (.cse40 (< 127 .cse44)) (.cse31 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse45 (< |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 ((.cse38 (< .cse44 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse43 .cse30))) (and (or (and (or .cse31 (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37)) .cse41) (or .cse42 (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse45) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse45) (or (let ((.cse47 (= .cse43 0)) (.cse48 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse43) .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 ((.cse50 (or .cse47 .cse37 .cse48)) (.cse51 (< .cse43 128)) (.cse49 (< .cse44 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) .cse43)) .cse30))))) (and (or .cse41 (let ((.cse46 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse32) .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))) (= .cse32 0)))) (and (or .cse33 (and (or (and .cse46 (or .cse34 .cse47 .cse37 .cse48)) .cse49) (or (and .cse46 .cse50) .cse40))) (or .cse51 (and (or .cse34 .cse52 .cse37) .cse46))))) (or .cse42 (let ((.cse54 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse32)) .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 ((.cse53 (and .cse50 .cse54))) (and (or .cse40 .cse53) (or .cse49 .cse53)))) (or .cse51 (let ((.cse55 (and (or .cse52 .cse37) .cse54))) (and (or .cse49 .cse55) (or .cse40 .cse55)))))))))) .cse45) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse45))))) is different from false [2024-11-09 04:33:48,281 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 ((.cse44 (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse43 (mod (+ .cse56 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse32 (mod .cse56 256))) (let ((.cse41 (< 127 .cse32)) (.cse34 (= .cse56 0)) (.cse42 (< .cse32 128)) (.cse33 (< 127 .cse43)) (.cse40 (< 127 .cse44)) (.cse31 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse37 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (.cse45 (< |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 ((.cse38 (< .cse44 .cse30)) (.cse39 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse36 (< .cse43 .cse30))) (and (or (and (or .cse31 (< .cse32 .cse30)) (or .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse34 .cse38 .cse39 .cse40 .cse37)) .cse41) (or .cse42 (and (or .cse38 .cse39 .cse40 .cse37) (or .cse33 .cse35 .cse36 .cse37))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse45) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| .cse30) .cse45) (or (let ((.cse47 (= .cse43 0)) (.cse48 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse43) .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 ((.cse50 (or .cse47 .cse37 .cse48)) (.cse51 (< .cse43 128)) (.cse49 (< .cse44 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) .cse43)) .cse30))))) (and (or .cse41 (let ((.cse46 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse32) .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))) (= .cse32 0)))) (and (or .cse33 (and (or (and .cse46 (or .cse34 .cse47 .cse37 .cse48)) .cse49) (or (and .cse46 .cse50) .cse40))) (or .cse51 (and (or .cse34 .cse52 .cse37) .cse46))))) (or .cse42 (let ((.cse54 (or .cse31 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (or (< (mod |v_ULTIMATE.start_gcd_test_~a#1_31| (+ (- 256) .cse32)) .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 ((.cse53 (and .cse50 .cse54))) (and (or .cse40 .cse53) (or .cse49 .cse53)))) (or .cse51 (let ((.cse55 (and (or .cse52 .cse37) .cse54))) (and (or .cse49 .cse55) (or .cse40 .cse55)))))))))) .cse45) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) .cse45))))) is different from true [2024-11-09 04:33:51,815 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse15 (+ .cse8 (- 256))) (.cse12 (<= 128 .cse8)) (.cse11 (<= .cse8 127)) (.cse17 (<= .cse30 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse2 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse2) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse5 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse5))) (and (not (= .cse3 0)) (= .cse4 (mod (+ (* .cse5 255) .cse3) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse5 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse6 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse6) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) (and (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse7 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse7) 0) (not (= .cse7 0))))) .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse10 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse10))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse9 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse10 0)) (= .cse4 (mod (+ (* 255 .cse10) .cse9) 256))))))) .cse11) (and .cse12 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse14 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (= .cse4 (mod (+ .cse13 .cse14 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse13 0)) (not (= .cse14 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse16 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_36|) 256) (- 256))) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (not (= .cse16 0))))) .cse1)))) .cse17) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse18 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse18 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse18) 256))) |c_ULTIMATE.start_gcd_test_~a#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse20 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (.cse21 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ .cse20 .cse21) 256))))) (and (= .cse4 (mod (+ .cse19 .cse20 .cse21) 256)) (not (= .cse19 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse21 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse22 (mod .cse15 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~b#1_36|) .cse22) 256))) 0) (not (= .cse22 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))))) .cse12) (and .cse11 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse24 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse24))) (and (not (= .cse23 0)) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_28| 1) 0) (not (= .cse24 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0)) (= .cse4 (mod (+ (* 255 .cse24) .cse23) 256)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse25 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_28|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (not (= .cse25 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse25)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse26 (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= |v_ULTIMATE.start_gcd_test_~b#1_36| 127) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_36|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse26) 0) (not (= .cse26 0)) (not (= |v_ULTIMATE.start_gcd_test_~b#1_36| 0))))) .cse1)))) .cse17) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse28))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse27 0)) (= .cse4 (mod (+ (* .cse28 255) .cse27) 256)) (not (= .cse28 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_36| Int) (|v_ULTIMATE.start_gcd_test_~a#1_28| Int)) (let ((.cse29 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_36|))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_28| |v_ULTIMATE.start_gcd_test_~b#1_36|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_36| 1) 0) (not (= .cse29 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_36|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_28| .cse29) 0)))))) .cse0)))) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |c_ULTIMATE.start_main1_~x~0#1| 1)))) is different from true [2024-11-09 04:34:09,349 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 04:34:11,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 04:34:14,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 04:34:17,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 04:34:19,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 04:34:22,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 04:34:56,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 04:34:58,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 04:35:01,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 04:35:03,470 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 04:35:05,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 04:35:08,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-09 04:35:10,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-09 04:35:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:10,464 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-09 04:35:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 04:35:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 04:35:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:10,465 INFO L225 Difference]: With dead ends: 41 [2024-11-09 04:35:10,466 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 04:35:10,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 137.5s TimeCoverageRelationStatistics Valid=135, Invalid=592, Unknown=53, NotChecked=342, Total=1122 [2024-11-09 04:35:10,467 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:10,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 139 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 37 Unknown, 155 Unchecked, 40.1s Time] [2024-11-09 04:35:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 04:35:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-09 04:35:10,492 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 04:35:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-09 04:35:10,493 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2024-11-09 04:35:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:10,493 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-09 04:35:10,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:35:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-09 04:35:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 04:35:10,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:10,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:10,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:35:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:10,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 235847532, now seen corresponding path program 1 times [2024-11-09 04:35:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:35:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678010775] [2024-11-09 04:35:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:35:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:35:10,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:35:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:35:10,726 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:35:10,727 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:35:10,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 04:35:10,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 04:35:10,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:35:10,734 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 04:35:10,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:35:10,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:35:10 BoogieIcfgContainer [2024-11-09 04:35:10,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:35:10,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:35:10,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:35:10,756 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:35:10,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:40" (3/4) ... [2024-11-09 04:35:10,759 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:35:10,760 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:35:10,761 INFO L158 Benchmark]: Toolchain (without parser) took 271617.70ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 122.3MB in the beginning and 105.7MB in the end (delta: 16.5MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,761 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:35:10,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.58ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 124.7MB in the end (delta: -2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.34ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 123.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,762 INFO L158 Benchmark]: Boogie Preprocessor took 29.27ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 121.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,763 INFO L158 Benchmark]: RCFGBuilder took 415.10ms. Allocated memory is still 157.3MB. Free memory was 121.8MB in the beginning and 103.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,763 INFO L158 Benchmark]: TraceAbstraction took 270736.28ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 102.9MB in the beginning and 106.8MB in the end (delta: -3.8MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,763 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 105.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:35:10,765 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.20ms. Allocated memory is still 113.2MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.58ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 124.7MB in the end (delta: -2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.34ms. Allocated memory is still 157.3MB. Free memory was 124.7MB in the beginning and 123.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.27ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 121.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.10ms. Allocated memory is still 157.3MB. Free memory was 121.8MB in the beginning and 103.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 270736.28ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 102.9MB in the beginning and 106.8MB in the end (delta: -3.8MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 105.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 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 > -2.0f && IN < 2.0f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -2.0f && IN < 2.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: 270.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 132.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 41.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 37.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 243 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 64 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 174.8s 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, 121.1s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 12 QuantifiedInterpolants, 7306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 04:35:10,980 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 04:35:11,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 4c99a7d37e4951c8ef9fe39502528fd8fe86fdb39a219c9a8916753f22b09b28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:35:13,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:35:13,442 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 04:35:13,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:35:13,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:35:13,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:35:13,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:35:13,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:35:13,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:35:13,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:35:13,504 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:35:13,504 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:35:13,505 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:35:13,508 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:35:13,508 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:35:13,508 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:35:13,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:35:13,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:35:13,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:35:13,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:35:13,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:35:13,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:35:13,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:35:13,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:35:13,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:35:13,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:35:13,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:35:13,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:35:13,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:35:13,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:35:13,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:35:13,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:35:13,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:35:13,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:35:13,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:35:13,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:35:13,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:35:13,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:35:13,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:35:13,522 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:35:13,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:35:13,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:35:13,523 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:35:13,523 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/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_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 -> 4c99a7d37e4951c8ef9fe39502528fd8fe86fdb39a219c9a8916753f22b09b28 [2024-11-09 04:35:13,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:35:13,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:35:13,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:35:13,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:35:13,937 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:35:13,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/gcd_3+newton_2_8.i Unable to find full path for "g++" [2024-11-09 04:35:16,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:35:16,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:35:16,299 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i [2024-11-09 04:35:16,312 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data/364f2a9fe/263d6e0ea5f648f998bc1372cff07da2/FLAG51e38f182 [2024-11-09 04:35:16,332 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/data/364f2a9fe/263d6e0ea5f648f998bc1372cff07da2 [2024-11-09 04:35:16,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:35:16,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:35:16,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:35:16,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:35:16,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:35:16,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1010440d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16, skipping insertion in model container [2024-11-09 04:35:16,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:35:16,620 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[1226,1239] [2024-11-09 04:35:16,663 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[2841,2854] [2024-11-09 04:35:16,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:35:16,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:35:16,708 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[1226,1239] [2024-11-09 04:35:16,720 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_372bd508-4a75-446a-aeb1-115d4b0b3d35/sv-benchmarks/c/combinations/gcd_3+newton_2_8.i[2841,2854] [2024-11-09 04:35:16,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:35:16,745 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:35:16,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16 WrapperNode [2024-11-09 04:35:16,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:35:16,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:35:16,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:35:16,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:35:16,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,818 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2024-11-09 04:35:16,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:35:16,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:35:16,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:35:16,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:35:16,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:35:16,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:35:16,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:35:16,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:35:16,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (1/1) ... [2024-11-09 04:35:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:35:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:16,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:35:16,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:35:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:35:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:35:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-09 04:35:16,969 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-09 04:35:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 04:35:16,971 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 04:35:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:35:16,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:35:17,065 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:35:17,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:35:24,828 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 04:35:24,828 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:35:24,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:35:24,841 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:35:24,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:35:24 BoogieIcfgContainer [2024-11-09 04:35:24,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:35:24,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:35:24,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:35:24,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:35:24,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:35:16" (1/3) ... [2024-11-09 04:35:24,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@facbb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:35:24, skipping insertion in model container [2024-11-09 04:35:24,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:35:16" (2/3) ... [2024-11-09 04:35:24,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@facbb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:35:24, skipping insertion in model container [2024-11-09 04:35:24,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:35:24" (3/3) ... [2024-11-09 04:35:24,855 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_8.i [2024-11-09 04:35:24,872 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:35:24,872 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 04:35:24,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:35:24,932 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;@1e62684d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:35:24,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 04:35:24,937 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 04:35:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:35:24,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:24,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:24,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1594868719, now seen corresponding path program 1 times [2024-11-09 04:35:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459359792] [2024-11-09 04:35:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:24,972 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 04:35:24,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:24,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:24,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:25,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:35:25,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:25,221 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 04:35:25,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:35:25,222 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:35:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459359792] [2024-11-09 04:35:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459359792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:35:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:35:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350964915] [2024-11-09 04:35:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:35:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:35:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:35:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:35:25,253 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 04:35:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:25,405 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 04:35:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:35:25,410 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 04:35:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:25,418 INFO L225 Difference]: With dead ends: 70 [2024-11-09 04:35:25,418 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 04:35:25,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 04:35:25,428 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:25,429 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.1s Time] [2024-11-09 04:35:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 04:35:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 04:35:25,470 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 04:35:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 04:35:25,473 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-09 04:35:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:25,474 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 04:35:25,474 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 04:35:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 04:35:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:35:25,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:25,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:25,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:25,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:25,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 180138643, now seen corresponding path program 1 times [2024-11-09 04:35:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:25,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891684618] [2024-11-09 04:35:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:25,682 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 04:35:25,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:25,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:25,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:25,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 04:35:25,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:25,935 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 04:35:25,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:35:25,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:35:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891684618] [2024-11-09 04:35:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891684618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:25,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:35:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:35:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675344608] [2024-11-09 04:35:25,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:35:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:35:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:35:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:35:25,940 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 04:35:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:26,156 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 04:35:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:35:26,157 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 04:35:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:26,158 INFO L225 Difference]: With dead ends: 46 [2024-11-09 04:35:26,158 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 04:35:26,159 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 04:35:26,162 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 04:35:26,163 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 04:35:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 04:35:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-09 04:35:26,172 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 04:35:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 04:35:26,175 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 04:35:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:26,175 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 04:35:26,176 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 04:35:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 04:35:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:35:26,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:26,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:26,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:26,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:26,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:26,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash -629207983, now seen corresponding path program 1 times [2024-11-09 04:35:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052971281] [2024-11-09 04:35:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:26,381 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 04:35:26,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:26,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:26,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:26,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:35:26,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:27,023 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 04:35:27,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:35:27,024 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:35:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052971281] [2024-11-09 04:35:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052971281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:35:27,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:35:27,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:35:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948173873] [2024-11-09 04:35:27,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:35:27,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:35:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:35:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:35:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:35:27,029 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 04:35:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:27,271 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 04:35:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:35:27,272 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 04:35:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:27,273 INFO L225 Difference]: With dead ends: 40 [2024-11-09 04:35:27,274 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 04:35:27,274 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 04:35:27,276 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:27,276 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.2s Time] [2024-11-09 04:35:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 04:35:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 04:35:27,282 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 04:35:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 04:35:27,283 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-11-09 04:35:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:27,284 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 04:35:27,284 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 04:35:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 04:35:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:35:27,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:27,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:27,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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)] Ended with exit code 0 [2024-11-09 04:35:27,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:27,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1552324308, now seen corresponding path program 1 times [2024-11-09 04:35:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694371637] [2024-11-09 04:35:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:27,489 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 04:35:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:27,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:27,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:27,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 04:35:27,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:30,971 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 04:35:30,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:38,422 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 04:35:38,423 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:35:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694371637] [2024-11-09 04:35:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694371637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:35:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542067960] [2024-11-09 04:35:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:35:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:35:38,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:35:38,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 04:35:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:38,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 04:35:38,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:39,710 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 04:35:39,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:40,532 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 04:35:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [542067960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:35:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387590300] [2024-11-09 04:35:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:35:40,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:35:40,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:35:40,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:35:40,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:35:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:35:40,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 04:35:40,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:35:42,023 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 04:35:42,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:35:42,961 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 04:35:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387590300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:35:42,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 04:35:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 10, 10] total 18 [2024-11-09 04:35:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947006883] [2024-11-09 04:35:42,963 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 04:35:42,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:35:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:35:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:35:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:35:42,965 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 04:35:46,395 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 04:35:47,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:35:49,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:35:52,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 04:35:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:35:53,131 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-09 04:35:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:35:53,132 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 04:35:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:35:53,133 INFO L225 Difference]: With dead ends: 48 [2024-11-09 04:35:53,133 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 04:35:53,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:35:53,134 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.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, 10.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:35:53,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 289 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-11-09 04:35:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 04:35:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-09 04:35:53,140 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 04:35:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 04:35:53,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 13 [2024-11-09 04:35:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:35:53,142 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 04:35:53,142 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 04:35:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 04:35:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 04:35:53,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:35:53,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:35:53,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 04:35:53,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 04:35:53,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:53,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:53,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:35:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:35:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1058982499, now seen corresponding path program 2 times [2024-11-09 04:35:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:35:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330275991] [2024-11-09 04:35:53,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:35:53,746 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 04:35:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:35:53,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:53,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/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 04:35:59,262 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:35:59,262 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:35:59,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:35:59,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:06,008 WARN L286 SmtUtils]: Spent 16.49s 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 04:38:22,455 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 04:38:24,469 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 04:38:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:38:24,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:42:20,738 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 04:42:22,774 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 04:42:37,432 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 04:42:37,432 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:42:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330275991] [2024-11-09 04:42:37,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330275991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:42:37,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1195527708] [2024-11-09 04:42:37,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:42:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 04:42:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 04:42:37,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 04:42:37,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-09 04:42:38,046 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:42:38,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:42:38,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:42:38,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:44:00,392 WARN L286 SmtUtils]: Spent 17.06s 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 04:44:17,070 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 04:44:19,094 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 04:44:19,095 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 04:44:19,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:44:51,508 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 04:44:53,535 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 04:45:08,152 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 04:45:08,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1195527708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:45:08,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156552769] [2024-11-09 04:45:08,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 04:45:08,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:45:08,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:45:08,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372bd508-4a75-446a-aeb1-115d4b0b3d35/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 04:45:13,299 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 04:45:13,299 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:45:13,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 04:45:13,323 INFO L278 TraceCheckSpWp]: Computing forward predicates...