./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh --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 384baf663e8fa66fe4dacec773bc2c5acf71b0d621e6212d04013b3fa3b41d51 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:35:10,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:35:10,987 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:35:10,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:35:10,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:35:11,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:35:11,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:35:11,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:35:11,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:35:11,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:35:11,025 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:35:11,026 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:35:11,026 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:35:11,027 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:35:11,027 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:35:11,028 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:35:11,028 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:35:11,029 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:35:11,029 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:35:11,030 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:35:11,030 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:35:11,031 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:35:11,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:35:11,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:35:11,033 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:35:11,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:35:11,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:35:11,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:35:11,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:35:11,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:35:11,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:35:11,036 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:35:11,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:35:11,037 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:35:11,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:35:11,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:35:11,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:35:11,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:35:11,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:35:11,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:35:11,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:35:11,039 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:35:11,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:35:11,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:35:11,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:35:11,040 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:35:11,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:35:11,040 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_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/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_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh 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 -> 384baf663e8fa66fe4dacec773bc2c5acf71b0d621e6212d04013b3fa3b41d51 [2023-12-02 19:35:11,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:35:11,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:35:11,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:35:11,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:35:11,319 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:35:11,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2023-12-02 19:35:14,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:35:14,680 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:35:14,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i [2023-12-02 19:35:14,701 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/data/d8cf4422b/7a7d8a530e3641e189d9fa2575cc025c/FLAGd7fc68b63 [2023-12-02 19:35:14,976 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/data/d8cf4422b/7a7d8a530e3641e189d9fa2575cc025c [2023-12-02 19:35:14,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:35:14,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:35:14,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:35:14,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:35:14,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:35:14,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:35:14" (1/1) ... [2023-12-02 19:35:14,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f54d64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:14, skipping insertion in model container [2023-12-02 19:35:14,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:35:14" (1/1) ... [2023-12-02 19:35:15,058 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:35:15,244 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i[951,964] [2023-12-02 19:35:15,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:35:15,519 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:35:15,535 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/sv-benchmarks/c/pthread-wmm/safe008_power.opt.i[951,964] [2023-12-02 19:35:15,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:35:15,645 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 19:35:15,646 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 19:35:15,656 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:35:15,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15 WrapperNode [2023-12-02 19:35:15,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:35:15,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:35:15,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:35:15,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:35:15,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,727 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2023-12-02 19:35:15,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:35:15,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:35:15,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:35:15,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:35:15,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:35:15,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:35:15,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:35:15,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:35:15,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (1/1) ... [2023-12-02 19:35:15,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:35:15,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:35:15,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:35:15,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:35:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:35:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:35:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 19:35:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:35:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:35:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:35:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 19:35:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 19:35:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 19:35:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 19:35:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 19:35:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 19:35:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:35:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 19:35:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:35:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:35:15,901 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 19:35:16,098 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:35:16,101 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:35:16,580 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:35:16,999 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:35:16,999 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 19:35:17,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:35:17 BoogieIcfgContainer [2023-12-02 19:35:17,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:35:17,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:35:17,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:35:17,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:35:17,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:35:14" (1/3) ... [2023-12-02 19:35:17,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b27f73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:35:17, skipping insertion in model container [2023-12-02 19:35:17,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:35:15" (2/3) ... [2023-12-02 19:35:17,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b27f73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:35:17, skipping insertion in model container [2023-12-02 19:35:17,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:35:17" (3/3) ... [2023-12-02 19:35:17,025 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2023-12-02 19:35:17,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 19:35:17,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:35:17,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 19:35:17,051 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 19:35:17,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 19:35:17,176 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 39 transitions, 90 flow [2023-12-02 19:35:17,433 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4050 states, 4047 states have (on average 3.4996293550778352) internal successors, (14163), 4049 states have internal predecessors, (14163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:17,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:35:17,460 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fbe04a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:35:17,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 19:35:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 4050 states, 4047 states have (on average 3.4996293550778352) internal successors, (14163), 4049 states have internal predecessors, (14163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 19:35:17,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:17,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 19:35:17,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:17,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 675502991, now seen corresponding path program 1 times [2023-12-02 19:35:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399452093] [2023-12-02 19:35:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:17,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:17,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:17,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399452093] [2023-12-02 19:35:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399452093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:17,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 19:35:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805925596] [2023-12-02 19:35:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:17,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:35:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:35:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:35:17,989 INFO L87 Difference]: Start difference. First operand has 4050 states, 4047 states have (on average 3.4996293550778352) internal successors, (14163), 4049 states have internal predecessors, (14163), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:18,227 INFO L93 Difference]: Finished difference Result 3495 states and 11970 transitions. [2023-12-02 19:35:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:35:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-02 19:35:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:18,293 INFO L225 Difference]: With dead ends: 3495 [2023-12-02 19:35:18,294 INFO L226 Difference]: Without dead ends: 3201 [2023-12-02 19:35:18,295 INFO L412 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 [2023-12-02 19:35:18,300 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:18,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 25 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:35:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2023-12-02 19:35:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2023-12-02 19:35:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 3.43) internal successors, (10976), 3200 states have internal predecessors, (10976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 10976 transitions. [2023-12-02 19:35:18,600 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 10976 transitions. Word has length 5 [2023-12-02 19:35:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:18,601 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 10976 transitions. [2023-12-02 19:35:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 10976 transitions. [2023-12-02 19:35:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 19:35:18,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:18,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:18,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:35:18,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:18,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -173623484, now seen corresponding path program 1 times [2023-12-02 19:35:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:18,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21359635] [2023-12-02 19:35:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:18,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:18,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21359635] [2023-12-02 19:35:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21359635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:18,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:35:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719613973] [2023-12-02 19:35:18,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:35:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:35:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:35:18,930 INFO L87 Difference]: Start difference. First operand 3201 states and 10976 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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) [2023-12-02 19:35:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:19,377 INFO L93 Difference]: Finished difference Result 3495 states and 11725 transitions. [2023-12-02 19:35:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:35:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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 [2023-12-02 19:35:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:19,411 INFO L225 Difference]: With dead ends: 3495 [2023-12-02 19:35:19,411 INFO L226 Difference]: Without dead ends: 2809 [2023-12-02 19:35:19,412 INFO L412 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 [2023-12-02 19:35:19,413 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:19,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 95 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:35:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2023-12-02 19:35:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2023-12-02 19:35:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2808 states have (on average 3.3903133903133904) internal successors, (9520), 2808 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 9520 transitions. [2023-12-02 19:35:19,553 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 9520 transitions. Word has length 14 [2023-12-02 19:35:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:19,555 INFO L495 AbstractCegarLoop]: Abstraction has 2809 states and 9520 transitions. [2023-12-02 19:35:19,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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) [2023-12-02 19:35:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 9520 transitions. [2023-12-02 19:35:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 19:35:19,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:19,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:19,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:35:19,561 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:19,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash 531279461, now seen corresponding path program 1 times [2023-12-02 19:35:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:19,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951392685] [2023-12-02 19:35:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:19,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951392685] [2023-12-02 19:35:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951392685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 19:35:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421241884] [2023-12-02 19:35:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:19,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 19:35:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 19:35:19,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:35:19,859 INFO L87 Difference]: Start difference. First operand 2809 states and 9520 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:20,268 INFO L93 Difference]: Finished difference Result 3579 states and 11951 transitions. [2023-12-02 19:35:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:35:20,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2023-12-02 19:35:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:20,287 INFO L225 Difference]: With dead ends: 3579 [2023-12-02 19:35:20,287 INFO L226 Difference]: Without dead ends: 1864 [2023-12-02 19:35:20,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:35:20,289 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 136 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:20,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 92 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:35:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2023-12-02 19:35:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1864. [2023-12-02 19:35:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 3.2549651100375736) internal successors, (6064), 1863 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 6064 transitions. [2023-12-02 19:35:20,362 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 6064 transitions. Word has length 16 [2023-12-02 19:35:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:20,362 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 6064 transitions. [2023-12-02 19:35:20,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 6064 transitions. [2023-12-02 19:35:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:35:20,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:20,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:20,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:35:20,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:20,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash -703477853, now seen corresponding path program 1 times [2023-12-02 19:35:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443036671] [2023-12-02 19:35:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:20,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443036671] [2023-12-02 19:35:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443036671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:20,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:20,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:35:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576510307] [2023-12-02 19:35:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:20,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:35:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:35:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:35:20,643 INFO L87 Difference]: Start difference. First operand 1864 states and 6064 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:20,897 INFO L93 Difference]: Finished difference Result 2112 states and 6766 transitions. [2023-12-02 19:35:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:35:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-12-02 19:35:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:20,919 INFO L225 Difference]: With dead ends: 2112 [2023-12-02 19:35:20,919 INFO L226 Difference]: Without dead ends: 1832 [2023-12-02 19:35:20,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:35:20,921 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:20,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:35:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2023-12-02 19:35:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2023-12-02 19:35:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1831 states have (on average 3.2463134898962314) internal successors, (5944), 1831 states have internal predecessors, (5944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 5944 transitions. [2023-12-02 19:35:21,003 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 5944 transitions. Word has length 19 [2023-12-02 19:35:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:21,004 INFO L495 AbstractCegarLoop]: Abstraction has 1832 states and 5944 transitions. [2023-12-02 19:35:21,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 5944 transitions. [2023-12-02 19:35:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:35:21,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:21,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 19:35:21,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:21,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash -137065208, now seen corresponding path program 1 times [2023-12-02 19:35:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192712841] [2023-12-02 19:35:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:21,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:21,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192712841] [2023-12-02 19:35:21,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192712841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:21,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:35:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860442140] [2023-12-02 19:35:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:21,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:35:21,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:21,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:35:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:35:21,320 INFO L87 Difference]: Start difference. First operand 1832 states and 5944 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:21,657 INFO L93 Difference]: Finished difference Result 2808 states and 8912 transitions. [2023-12-02 19:35:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:35:21,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2023-12-02 19:35:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:21,679 INFO L225 Difference]: With dead ends: 2808 [2023-12-02 19:35:21,680 INFO L226 Difference]: Without dead ends: 2024 [2023-12-02 19:35:21,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:35:21,681 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:21,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 90 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:35:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2023-12-02 19:35:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1704. [2023-12-02 19:35:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.1685261303581913) internal successors, (5396), 1703 states have internal predecessors, (5396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 5396 transitions. [2023-12-02 19:35:21,758 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 5396 transitions. Word has length 20 [2023-12-02 19:35:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:21,758 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 5396 transitions. [2023-12-02 19:35:21,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 5396 transitions. [2023-12-02 19:35:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:35:21,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:21,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:21,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 19:35:21,764 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:21,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1372549788, now seen corresponding path program 1 times [2023-12-02 19:35:21,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100598223] [2023-12-02 19:35:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:23,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100598223] [2023-12-02 19:35:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100598223] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 19:35:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800558514] [2023-12-02 19:35:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:23,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:35:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:35:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:35:23,621 INFO L87 Difference]: Start difference. First operand 1704 states and 5396 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:24,317 INFO L93 Difference]: Finished difference Result 2015 states and 6328 transitions. [2023-12-02 19:35:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 19:35:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2023-12-02 19:35:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:24,336 INFO L225 Difference]: With dead ends: 2015 [2023-12-02 19:35:24,336 INFO L226 Difference]: Without dead ends: 1779 [2023-12-02 19:35:24,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:35:24,338 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 103 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:24,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 126 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 19:35:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2023-12-02 19:35:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2023-12-02 19:35:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1778 states have (on average 3.155230596175478) internal successors, (5610), 1778 states have internal predecessors, (5610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 5610 transitions. [2023-12-02 19:35:24,416 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 5610 transitions. Word has length 21 [2023-12-02 19:35:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:24,417 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 5610 transitions. [2023-12-02 19:35:24,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 5610 transitions. [2023-12-02 19:35:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:35:24,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:24,423 INFO L195 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] [2023-12-02 19:35:24,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:35:24,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:24,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -711851265, now seen corresponding path program 1 times [2023-12-02 19:35:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465603374] [2023-12-02 19:35:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:24,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465603374] [2023-12-02 19:35:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465603374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:35:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868535513] [2023-12-02 19:35:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:24,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:35:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:24,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:35:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:35:24,719 INFO L87 Difference]: Start difference. First operand 1779 states and 5610 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:24,873 INFO L93 Difference]: Finished difference Result 1725 states and 5123 transitions. [2023-12-02 19:35:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:35:24,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-12-02 19:35:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:24,889 INFO L225 Difference]: With dead ends: 1725 [2023-12-02 19:35:24,889 INFO L226 Difference]: Without dead ends: 1458 [2023-12-02 19:35:24,890 INFO L412 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 [2023-12-02 19:35:24,891 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:24,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 30 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:35:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2023-12-02 19:35:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1444. [2023-12-02 19:35:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 3.0187110187110187) internal successors, (4356), 1443 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 4356 transitions. [2023-12-02 19:35:24,947 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 4356 transitions. Word has length 22 [2023-12-02 19:35:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:24,947 INFO L495 AbstractCegarLoop]: Abstraction has 1444 states and 4356 transitions. [2023-12-02 19:35:24,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 4356 transitions. [2023-12-02 19:35:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 19:35:24,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:24,953 INFO L195 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, 1] [2023-12-02 19:35:24,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 19:35:24,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:24,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2027950174, now seen corresponding path program 1 times [2023-12-02 19:35:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:24,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782340486] [2023-12-02 19:35:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:26,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:26,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782340486] [2023-12-02 19:35:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782340486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:26,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 19:35:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841546123] [2023-12-02 19:35:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:26,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:35:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:35:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:35:26,932 INFO L87 Difference]: Start difference. First operand 1444 states and 4356 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:27,396 INFO L93 Difference]: Finished difference Result 1580 states and 4729 transitions. [2023-12-02 19:35:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:35:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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 24 [2023-12-02 19:35:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:27,405 INFO L225 Difference]: With dead ends: 1580 [2023-12-02 19:35:27,406 INFO L226 Difference]: Without dead ends: 1500 [2023-12-02 19:35:27,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:35:27,407 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:27,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 19:35:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-12-02 19:35:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1444. [2023-12-02 19:35:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 3.0152460152460154) internal successors, (4351), 1443 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 4351 transitions. [2023-12-02 19:35:27,452 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 4351 transitions. Word has length 24 [2023-12-02 19:35:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 1444 states and 4351 transitions. [2023-12-02 19:35:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 4351 transitions. [2023-12-02 19:35:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 19:35:27,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:27,457 INFO L195 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, 1] [2023-12-02 19:35:27,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 19:35:27,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:27,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash 209272414, now seen corresponding path program 1 times [2023-12-02 19:35:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:27,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77676580] [2023-12-02 19:35:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:27,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77676580] [2023-12-02 19:35:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77676580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:35:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667305438] [2023-12-02 19:35:27,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:35:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:35:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:35:27,732 INFO L87 Difference]: Start difference. First operand 1444 states and 4351 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:27,937 INFO L93 Difference]: Finished difference Result 1148 states and 3255 transitions. [2023-12-02 19:35:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:35:27,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2023-12-02 19:35:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:27,944 INFO L225 Difference]: With dead ends: 1148 [2023-12-02 19:35:27,944 INFO L226 Difference]: Without dead ends: 974 [2023-12-02 19:35:27,944 INFO L412 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 [2023-12-02 19:35:27,945 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 85 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:27,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 35 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:35:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-02 19:35:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 932. [2023-12-02 19:35:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 2.8345864661654137) internal successors, (2639), 931 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2639 transitions. [2023-12-02 19:35:27,994 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2639 transitions. Word has length 24 [2023-12-02 19:35:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:27,994 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2639 transitions. [2023-12-02 19:35:27,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2639 transitions. [2023-12-02 19:35:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:35:27,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:27,999 INFO L195 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, 1, 1, 1] [2023-12-02 19:35:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 19:35:28,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:28,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1048604675, now seen corresponding path program 1 times [2023-12-02 19:35:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48518698] [2023-12-02 19:35:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:35:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:35:28,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:35:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48518698] [2023-12-02 19:35:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48518698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:35:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:35:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:35:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643475993] [2023-12-02 19:35:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:35:28,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:35:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:35:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:35:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:35:28,354 INFO L87 Difference]: Start difference. First operand 932 states and 2639 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:35:28,534 INFO L93 Difference]: Finished difference Result 724 states and 2011 transitions. [2023-12-02 19:35:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:35:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2023-12-02 19:35:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:35:28,536 INFO L225 Difference]: With dead ends: 724 [2023-12-02 19:35:28,536 INFO L226 Difference]: Without dead ends: 404 [2023-12-02 19:35:28,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:35:28,538 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:35:28,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 24 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:35:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-02 19:35:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 386. [2023-12-02 19:35:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.7168831168831167) internal successors, (1046), 385 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1046 transitions. [2023-12-02 19:35:28,552 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1046 transitions. Word has length 26 [2023-12-02 19:35:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:35:28,552 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 1046 transitions. [2023-12-02 19:35:28,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:35:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1046 transitions. [2023-12-02 19:35:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 19:35:28,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:35:28,555 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:28,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 19:35:28,555 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-12-02 19:35:28,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:35:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash 377682899, now seen corresponding path program 1 times [2023-12-02 19:35:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:35:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456362521] [2023-12-02 19:35:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:35:28,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:35:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 19:35:28,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 19:35:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 19:35:28,853 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 19:35:28,854 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 19:35:28,855 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-12-02 19:35:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-02 19:35:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-12-02 19:35:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-12-02 19:35:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-12-02 19:35:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-02 19:35:28,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 19:35:28,863 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:35:28,870 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 19:35:28,870 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:35:28,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated [2023-12-02 19:35:28,947 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-12-02 19:35:28,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-12-02 19:35:28,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:35:28 BasicIcfg [2023-12-02 19:35:28,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:35:28,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:35:28,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:35:28,987 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:35:28,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:35:17" (3/4) ... [2023-12-02 19:35:28,988 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 19:35:29,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated [2023-12-02 19:35:29,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-12-02 19:35:29,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-12-02 19:35:29,132 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 19:35:29,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:35:29,133 INFO L158 Benchmark]: Toolchain (without parser) took 14152.23ms. Allocated memory was 155.2MB in the beginning and 394.3MB in the end (delta: 239.1MB). Free memory was 107.8MB in the beginning and 332.1MB in the end (delta: -224.3MB). Peak memory consumption was 239.5MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,133 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:35:29,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.65ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 82.7MB in the end (delta: 24.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.09ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 79.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,135 INFO L158 Benchmark]: Boogie Preprocessor took 52.82ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 77.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,135 INFO L158 Benchmark]: RCFGBuilder took 1217.89ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 77.5MB in the beginning and 87.9MB in the end (delta: -10.4MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,136 INFO L158 Benchmark]: TraceAbstraction took 11982.97ms. Allocated memory was 207.6MB in the beginning and 394.3MB in the end (delta: 186.6MB). Free memory was 87.9MB in the beginning and 123.1MB in the end (delta: -35.2MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,136 INFO L158 Benchmark]: Witness Printer took 145.71ms. Allocated memory is still 394.3MB. Free memory was 123.1MB in the beginning and 332.1MB in the end (delta: -209.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 19:35:29,139 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.24ms. Allocated memory is still 155.2MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 674.65ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 82.7MB in the end (delta: 24.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.09ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 79.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.82ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 77.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1217.89ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 77.5MB in the beginning and 87.9MB in the end (delta: -10.4MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11982.97ms. Allocated memory was 207.6MB in the beginning and 394.3MB in the end (delta: 186.6MB). Free memory was 87.9MB in the beginning and 123.1MB in the end (delta: -35.2MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. * Witness Printer took 145.71ms. Allocated memory is still 394.3MB. Free memory was 123.1MB in the beginning and 332.1MB in the end (delta: -209.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 18]: 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_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L753] 0 int z = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1964; [L854] FCALL, FORK 0 pthread_create(&t1964, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1964={5:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0, z=0] [L855] 0 pthread_t t1965; [L856] FCALL, FORK 0 pthread_create(&t1965, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1964={5:0}, t1965={7:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0, z=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0, z=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=0] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=0] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=0] [L857] 0 pthread_t t1966; [L858] FCALL, FORK 0 pthread_create(&t1966, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1964={5:0}, t1965={7:0}, t1966={9:0}, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=0] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=0] [L828] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=1] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=1] [L760] 1 z = 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1964={5:0}, t1965={7:0}, t1966={9:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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 [__unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1964={5:0}, t1965={7:0}, t1966={9:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1964={5:0}, t1965={7:0}, t1966={9:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1, z=2] - UnprovableResult [Line: 18]: 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: 854]: 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: 858]: 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: 856]: 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 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 758 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 734 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1183 IncrementalHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 209 mSDtfsCounter, 1183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4050occurred in iteration=0, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 450 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2023-12-02 19:35:29,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06ed9b67-cb30-4953-bf3a-80067409b99b/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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