./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E --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 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:27:17,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:27:17,383 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:27:17,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:27:17,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:27:17,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:27:17,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:27:17,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:27:17,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:27:17,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:27:17,434 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:27:17,434 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:27:17,434 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:27:17,434 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:27:17,435 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:27:17,435 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:27:17,435 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:27:17,436 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:27:17,436 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:27:17,436 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:27:17,436 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:27:17,436 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:27:17,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:27:17,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:27:17,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:27:17,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:27:17,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:27:17,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:27:17,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:27:17,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:27:17,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:27:17,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:27:17,439 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E 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 -> 48c4b734419752ee9918164f01e542b34e2482d2668432fb42f6f1192b7f0b6a [2024-11-14 03:27:17,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:27:17,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:27:17,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:27:17,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:27:17,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:27:17,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i Unable to find full path for "g++" [2024-11-14 03:27:19,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:27:20,248 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:27:20,249 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-14 03:27:20,263 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/data/0b8ea7a2d/c6c631a65c0440b3986a22e48c110fb7/FLAG5ebe4e1e1 [2024-11-14 03:27:20,280 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/data/0b8ea7a2d/c6c631a65c0440b3986a22e48c110fb7 [2024-11-14 03:27:20,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:27:20,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:27:20,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:27:20,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:27:20,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:27:20,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cb2de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20, skipping insertion in model container [2024-11-14 03:27:20,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:27:20,536 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_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-14 03:27:20,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:27:20,758 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:27:20,771 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_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/sv-benchmarks/c/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-14 03:27:20,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:27:20,880 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:27:20,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20 WrapperNode [2024-11-14 03:27:20,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:27:20,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:27:20,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:27:20,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:27:20,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,951 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2024-11-14 03:27:20,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:27:20,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:27:20,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:27:20,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:27:20,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:27:20,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:27:20,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:27:20,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:27:20,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (1/1) ... [2024-11-14 03:27:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:27:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:27:21,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:27:21,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:27:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:27:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:27:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:27:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:27:21,067 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:27:21,231 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:27:21,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:27:21,681 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:27:21,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:27:21,959 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:27:21,959 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:27:21,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:27:21 BoogieIcfgContainer [2024-11-14 03:27:21,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:27:21,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:27:21,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:27:21,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:27:21,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:27:20" (1/3) ... [2024-11-14 03:27:21,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a431d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:27:21, skipping insertion in model container [2024-11-14 03:27:21,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:27:20" (2/3) ... [2024-11-14 03:27:21,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a431d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:27:21, skipping insertion in model container [2024-11-14 03:27:21,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:27:21" (3/3) ... [2024-11-14 03:27:21,976 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-14 03:27:21,998 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:27:21,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 31 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-14 03:27:22,000 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:27:22,089 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:27:22,140 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 31 transitions, 70 flow [2024-11-14 03:27:22,247 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 642 states, 639 states have (on average 2.6572769953051645) internal successors, (1698), 641 states have internal predecessors, (1698), 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-14 03:27:22,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:27:22,289 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;@3bed2528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:27:22,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-14 03:27:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 642 states, 639 states have (on average 2.6572769953051645) internal successors, (1698), 641 states have internal predecessors, (1698), 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-14 03:27:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:27:22,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:22,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:27:22,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 03:27:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 447664425, now seen corresponding path program 1 times [2024-11-14 03:27:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163734515] [2024-11-14 03:27:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:22,925 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-14 03:27:22,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163734515] [2024-11-14 03:27:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163734515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:22,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:22,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:27:22,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854295959] [2024-11-14 03:27:22,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:27:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:27:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:27:22,995 INFO L87 Difference]: Start difference. First operand has 642 states, 639 states have (on average 2.6572769953051645) internal successors, (1698), 641 states have internal predecessors, (1698), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:23,158 INFO L93 Difference]: Finished difference Result 674 states and 1774 transitions. [2024-11-14 03:27:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:27:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:27:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:23,182 INFO L225 Difference]: With dead ends: 674 [2024-11-14 03:27:23,182 INFO L226 Difference]: Without dead ends: 522 [2024-11-14 03:27:23,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-14 03:27:23,189 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:23,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:27:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-14 03:27:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-11-14 03:27:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 2.5969289827255277) internal successors, (1353), 521 states have internal predecessors, (1353), 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-14 03:27:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1353 transitions. [2024-11-14 03:27:23,285 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1353 transitions. Word has length 6 [2024-11-14 03:27:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:23,286 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 1353 transitions. [2024-11-14 03:27:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1353 transitions. [2024-11-14 03:27:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:27:23,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:23,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:23,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:27:23,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 03:27:23,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1596586140, now seen corresponding path program 1 times [2024-11-14 03:27:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230996850] [2024-11-14 03:27:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:23,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:23,722 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-14 03:27:23,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230996850] [2024-11-14 03:27:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230996850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:27:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892021217] [2024-11-14 03:27:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:23,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:27:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:23,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:27:23,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:27:23,726 INFO L87 Difference]: Start difference. First operand 522 states and 1353 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:24,094 INFO L93 Difference]: Finished difference Result 954 states and 2421 transitions. [2024-11-14 03:27:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:27:24,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 03:27:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:24,100 INFO L225 Difference]: With dead ends: 954 [2024-11-14 03:27:24,101 INFO L226 Difference]: Without dead ends: 602 [2024-11-14 03:27:24,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:27:24,104 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 55 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:24,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 97 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:27:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-14 03:27:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 506. [2024-11-14 03:27:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 2.5247524752475248) internal successors, (1275), 505 states have internal predecessors, (1275), 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-14 03:27:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1275 transitions. [2024-11-14 03:27:24,145 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1275 transitions. Word has length 12 [2024-11-14 03:27:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 1275 transitions. [2024-11-14 03:27:24,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:27:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1275 transitions. [2024-11-14 03:27:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:27:24,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:24,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:24,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:27:24,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 03:27:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1349630875, now seen corresponding path program 1 times [2024-11-14 03:27:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:24,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984672782] [2024-11-14 03:27:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:24,425 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-14 03:27:24,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984672782] [2024-11-14 03:27:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984672782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:27:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91686] [2024-11-14 03:27:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:24,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:27:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:27:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:27:24,429 INFO L87 Difference]: Start difference. First operand 506 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 03:27:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:24,565 INFO L93 Difference]: Finished difference Result 684 states and 1670 transitions. [2024-11-14 03:27:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:27:24,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-14 03:27:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:24,571 INFO L225 Difference]: With dead ends: 684 [2024-11-14 03:27:24,571 INFO L226 Difference]: Without dead ends: 324 [2024-11-14 03:27:24,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:27:24,576 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:24,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:27:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-14 03:27:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-14 03:27:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.2755417956656347) internal successors, (735), 323 states have internal predecessors, (735), 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-14 03:27:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 735 transitions. [2024-11-14 03:27:24,603 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 735 transitions. Word has length 14 [2024-11-14 03:27:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:24,604 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 735 transitions. [2024-11-14 03:27:24,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 03:27:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 735 transitions. [2024-11-14 03:27:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:27:24,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:24,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:24,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:27:24,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 03:27:24,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1386617447, now seen corresponding path program 1 times [2024-11-14 03:27:24,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:24,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983411339] [2024-11-14 03:27:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:24,992 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-14 03:27:24,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983411339] [2024-11-14 03:27:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983411339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:24,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:27:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415658080] [2024-11-14 03:27:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:24,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:27:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:27:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:27:24,996 INFO L87 Difference]: Start difference. First operand 324 states and 735 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-14 03:27:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:25,124 INFO L93 Difference]: Finished difference Result 352 states and 787 transitions. [2024-11-14 03:27:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:27:25,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-14 03:27:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:25,126 INFO L225 Difference]: With dead ends: 352 [2024-11-14 03:27:25,126 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 03:27:25,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:27:25,131 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:25,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 23 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:27:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 03:27:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 126. [2024-11-14 03:27:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.096) internal successors, (262), 125 states have internal predecessors, (262), 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-14 03:27:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 262 transitions. [2024-11-14 03:27:25,142 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 262 transitions. Word has length 18 [2024-11-14 03:27:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:25,143 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 262 transitions. [2024-11-14 03:27:25,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-14 03:27:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 262 transitions. [2024-11-14 03:27:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:27:25,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:25,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:25,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:27:25,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 03:27:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -250459398, now seen corresponding path program 1 times [2024-11-14 03:27:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291804224] [2024-11-14 03:27:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:25,573 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-14 03:27:25,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:27:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291804224] [2024-11-14 03:27:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291804224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:27:25,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:27:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:27:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642370712] [2024-11-14 03:27:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:27:25,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:27:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:27:25,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:27:25,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:27:25,576 INFO L87 Difference]: Start difference. First operand 126 states and 262 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-14 03:27:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:25,716 INFO L93 Difference]: Finished difference Result 202 states and 418 transitions. [2024-11-14 03:27:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:27:25,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 23 [2024-11-14 03:27:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:25,718 INFO L225 Difference]: With dead ends: 202 [2024-11-14 03:27:25,718 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 03:27:25,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:27:25,719 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:25,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:27:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 03:27:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-14 03:27:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.055045871559633) internal successors, (224), 109 states have internal predecessors, (224), 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-14 03:27:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 224 transitions. [2024-11-14 03:27:25,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 224 transitions. Word has length 23 [2024-11-14 03:27:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:25,730 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 224 transitions. [2024-11-14 03:27:25,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-14 03:27:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 224 transitions. [2024-11-14 03:27:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:27:25,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:25,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:25,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:27:25,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 03:27:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1712721914, now seen corresponding path program 2 times [2024-11-14 03:27:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:27:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370803618] [2024-11-14 03:27:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:27:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:27:25,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:27:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:27:26,058 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:27:26,058 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:27:26,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-14 03:27:26,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-14 03:27:26,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-14 03:27:26,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-14 03:27:26,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-14 03:27:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:27:26,070 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-14 03:27:26,160 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:27:26,160 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:27:26,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:27:26 BasicIcfg [2024-11-14 03:27:26,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:27:26,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:27:26,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:27:26,172 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:27:26,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:27:21" (3/4) ... [2024-11-14 03:27:26,174 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 03:27:26,270 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 03:27:26,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:27:26,271 INFO L158 Benchmark]: Toolchain (without parser) took 5987.41ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.5MB in the beginning and 46.2MB in the end (delta: 45.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-11-14 03:27:26,271 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:27:26,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.76ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 68.9MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:27:26,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.12ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 67.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:27:26,272 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 65.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:27:26,273 INFO L158 Benchmark]: RCFGBuilder took 980.26ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 79.4MB in the end (delta: -13.9MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-14 03:27:26,274 INFO L158 Benchmark]: TraceAbstraction took 4201.87ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 78.9MB in the beginning and 53.5MB in the end (delta: 25.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-14 03:27:26,274 INFO L158 Benchmark]: Witness Printer took 103.82ms. Allocated memory is still 142.6MB. Free memory was 53.5MB in the beginning and 46.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:27:26,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.76ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 68.9MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.12ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 67.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 65.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 980.26ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 79.4MB in the end (delta: -13.9MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4201.87ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 78.9MB in the beginning and 53.5MB in the end (delta: 25.4MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 103.82ms. Allocated memory is still 142.6MB. Free memory was 53.5MB in the beginning and 46.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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. - UnprovableResult [Line: 804]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 83 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=642occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 112 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2024-11-14 03:27:26,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f912e5d-f5aa-4e4c-b653-b9674f78dc71/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE